betaFeedback

WorksMathematics

A two-dimensional area law from a global spectral gap

Abstract

We prove an entropy area law for the unique ground state of a finite-range Hamiltonian on any finite induced subgraph of the square lattice. A lower bound on the spectral gap of the full Hamiltonian and fixed bounds on the local dimension, interaction range, and interaction strength suffice. For every set of sites, its entanglement entropy is bounded by a constant times the number of edges crossing its boundary, independently of the size and shape of the domain.

Introduction

The entanglement entropy of a pure quantum state measures how much information is shared by a region and its complement. Its elementary upper bound is proportional to the number of sites in the region. An area law replaces this volume by the number of interactions crossing the region’s boundary. We prove such a bound for the unique gapped ground state of a general finite-range Hamiltonian in two dimensions.

The setting and the theorem

Let Λ⊂Z2\Lambda\subset\mathbb{Z}^{2} be finite. Its edges join pairs at Euclidean distance one, so that Λ\Lambda carries the induced square-lattice graph. Write dΛd_{\Lambda} for graph distance, with value +∞+\infty between different components. At each site put a copy of Cq\mathbb{C}^{q}, and write HΛ=⨂x∈ΛCq\mathcal{H}_{\Lambda} = \bigotimes_{x \in\Lambda} \mathbb{C}^{q}. An operator supported on X⊆ΛX \subseteq\Lambda acts as the identity on the other tensor factors. An admissible Hamiltonian has the form

H=∑∅≠X⊆Λdiam⁡dΛX≤RhX,hX=hX∗,∥hX∥≤J.(1)H = \sum_{\substack{\varnothing\ne X \subseteq\Lambda\\ \operatorname{diam}_{d_{\Lambda}} X \le R}} h_X,\qquad h_X = h_X^{*},\qquad\lVert h_X\rVert\le J. \tag*{(1)}

There is one summand for each support XX; a summand may be zero. Here q≥1q \ge1 and R≥0R \ge0 are fixed integers and J>0J > 0 is fixed. This indexing convention bounds the sum of interaction norms at every site in terms of RR, JJ alone.

For A⊆ΛA \subseteq\Lambda define the edge boundary

∂ΛA={{x,y}:x∈A, y∈Λ∖A, ∣x−y∣1=1}.\partial_{\Lambda} A = \{\{x,y\}: x \in A,\ y \in\Lambda\setminus A,\ \lvert x-y\rvert_{1}=1\}.

If Ω∈HΛ\Omega\in\mathcal{H}_{\Lambda} is a unit vector, write ρA=Tr⁡Λ∖A∣Ω⟩⟨Ω∣\rho_A = \operatorname{Tr}_{\Lambda\setminus A} \lvert\Omega\rangle\langle\Omega\rvert and SΩ(A)=−Tr⁡ρAlog⁡ρAS_{\Omega}(A) = -\operatorname{Tr}\rho_A \log\rho_A, with 0log⁡0=00\log0=0. All logarithms are natural.

Theorem 1.1 (Area law). For every q,R,Jq,R,J as above and every Δ>0\Delta> 0, there is a finite constant C=C(q,R,J,Δ)C=C(q,R,J,\Delta) with the following property. Suppose that Λ\Lambda is a finite induced square-lattice domain and that the Hamiltonian (1.1) has a unique normalized ground vector Ω\Omega, up to phase, with ground energy E0E_0, and satisfies

H−E0id⁡≥Δ(id⁡−∣Ω⟩⟨Ω∣).H-E_0\operatorname{id} \ge\Delta\left(\operatorname{id}-\lvert\Omega\rangle\langle\Omega\rvert\right).

Then for every A⊆ΛA \subseteq\Lambda,

SΩ(A)≤C∣∂ΛA∣.(2)S_{\Omega}(A) \le C\lvert\partial_{\Lambda}A\rvert. \tag*{(2)}

The same constant applies to all such domains, sets, and Hamiltonians.

The distance in (1.1) is the distance within the induced graph. This distinction matters for domains with holes or disconnected components. The spectral assumption concerns the full Hamiltonian; no gap assumption is imposed on Hamiltonians restricted to smaller regions.

For completeness, the theorem also gives the usual vertex-boundary formulations. Define

∂inA={x∈A:∃y∉A, {x,y}∈∂ΛA},ZA=⋃e∈∂ΛAe.\partial_{\mathrm{in}} A = \{x \in A : \exists y \notin A,\ \{x,y\} \in\partial_{\Lambda}A\},\qquad Z_A = \bigcup_{e \in\partial_{\Lambda}A} e.

Corollary 1.2. The conclusion of Theorem 1.1 holds for every subset of a finite rectangular square lattice with bounded on-site and nearest-neighbor interactions and a unique ground state separated by a fixed global gap. For every domain covered by that theorem it also implies

SΩ(A)≤4C∣∂inA∣,SΩ(A)≤2C∣ZA∣.S_{\Omega}(A) \le4C\lvert\partial_{\mathrm{in}}A\rvert,\qquad S_{\Omega}(A) \le2C\lvert Z_A\rvert.

Proof. On-site and nearest-neighbor interactions have graph range at most one. Each inner boundary vertex is incident with between one and four crossing edges, so ∣∂inA∣≤∣∂ΛA∣≤4∣∂inA∣|\partial_{\mathrm{in}} A| \leq|\partial_{\Lambda} A| \leq4|\partial_{\mathrm{in}} A|. Counting both endpoints gives ∣ZA∣≤2∣∂ΛA∣≤4∣ZA∣|Z_A| \leq2|\partial_{\Lambda} A| \leq4|Z_A|. These inequalities include empty boundaries.

The relation between entanglement and boundary area arose in quantum-field calculations motivated by black-hole entropy. Bombelli, Koul, Lee, and Sorkin related entropy from tracing inaccessible quantum-field degrees of freedom to black-hole area [11]; Srednicki subsequently found area scaling numerically for a spherical region in the vacuum of a regulated free massless scalar field [36]. These calculations motivated the entanglement area-law question through regulated field models. For finite-dimensional lattice spins, the gap-to-area conjecture asks whether a unique ground state has an entropy bound proportional to boundary area when local dimension, interaction range and strength are bounded and the spectral gap has a size-independent positive lower bound [21, 8]. Theorem 1.1 gives an affirmative answer in the stated two-dimensional induced-domain setting.

In one dimension, Hastings proved a length-independent entropy bound for the unique ground state of a finite-range Hamiltonian with uniformly bounded interactions, fixed local dimension, and a positive spectral gap [21]. Arad, Landau, and Vazirani improved the dependence on the inverse gap for frustration-free chains using approximate ground-state projectors [8]. These are operators that preserve the ground vector while contracting its orthogonal complement, with controlled growth of Schmidt rank. Arad, Kitaev, Landau, and Vazirani extended this approach to general, possibly frustrated chains [7]. A complementary result of Brandão and Horodecki derives an area law for pure one-dimensional states from exponential decay of correlations between arbitrary separated regions [13]. This region-wise hypothesis is stronger than decay of single-site correlation functions. More generally, the exponential clustering theorem relates a spectral gap to decay of connected correlations of separated observables [30]; an entropy estimate requires control of the reduced state’s full spectrum. Anshu, Harrow, and Soleimanifar obtained boundary-dependent bounds on smooth entanglement spread, which measures the width of the significant part of that spectrum, including square-root boundary scaling on lattices up to logarithmic factors [5]. Such a width estimate leaves the location of the spectrum, and hence its entropy, to be controlled.

Strict area-law bounds in higher dimensions are also known for restricted model classes. Cramer, Eisert, Plenio, and Dreißig proved such a bound for arbitrary regions in cubic harmonic lattices with a finite-range positive potential matrix whose condition number is uniformly bounded [18]. These Gaussian models have infinite-dimensional oscillator sites and provide a comparison with the finite-dimensional spin setting considered here.

Other higher-dimensional results make additional spectral or thermodynamic assumptions. Masanes obtained bounds with logarithmic corrections from correlation decay and bounds on the number of low-energy states of restricted Hamiltonians [28]; Brandão and Cramer obtained a logarithmically corrected bound for cubic regions under a low-temperature heat-capacity hypothesis [12]. Cho proved strict area scaling for balls along boundary-growth families satisfying uniform gaps and an additional compatibility condition on successive reduced ground states [16]. These conditions supply information beyond the gap of the single full Hamiltonian considered here.

For two-dimensional spin systems, Anshu, Arad, and Gosset proved a subvolume bound for rectangular regions in a rectangular lattice with plaquette projector interactions, a unique frustration-free ground state, and a uniform local gap [3]. At fixed local dimension and local gap, the bound is O(b5/3log⁡7/3(2+b))O(b^{5/3}\log^{7/3}(2+b)), where bb is the rectangle’s boundary size. Their subsequent result gives

S≤n1+O((log⁡n)−1/5)S \leq n^{1+O((\log n)^{-1/5})}

across a vertical cut of length nn, again for locally gapped, frustration-free plaquette projector models with a unique ground state [2]. The local-gap assumption concerns restrictions of the Hamiltonian; it is stronger than a gap for the full system alone. The latter entropy bound is near-linear, and its theorem concerns vertical cuts. The setting considered here allows frustrated interactions, assumes a gap only for the full Hamiltonian, and includes arbitrary regions in arbitrary finite induced square-lattice domains. Arad, Firanko, and Jain extend approximate-projector methods to maximally mixed ground states and bound their mutual information, with a two-dimensional application under frustration-free and local-gap assumptions [6].

The proof below combines locality estimates with ways of expressing entropy through operator norms. For locality, we use the Lieb–Robinson framework [26, 29] and Kitaev’s centered spectral filter [23], Appendix D.1.2. Swingle and McGreevy discuss positive constraints obtained by squaring filtered terms, for which retaining a gap is a separate issue [37], Section 8.4. Here taking absolute values gives the operator domination that retains the full-system gap. Later, products of positive contractions derived from these constraints preserve the ground state and suppress excitations, as projection products do in detectability-lemma arguments [4]. Their localization uses propagation estimates for unital channels, related to dissipative Lieb–Robinson bounds [9]; the coupled random-product estimate needed here is proved in Section 10.

For the entropy comparison, bounds on local entanglement production are a precedent for controlling logarithmic commutators independently of spectator dimensions [39]. Section 3 proves the quadratic real-part estimate needed for our marginal tails. Strong subadditivity and conditional-entropy continuity supply the entropy inequalities used throughout [27, 1, 41]. We encode marginal spectra on symmetric tensor powers using Schur–Weyl duality [19], whose connection with spectrum estimation is developed by Keyl and Werner [22]. The passage back to one-copy vectors uses finite quantum de Finetti measures [17, 25] and the product calculus of symmetrized finite observables [35]. Weighted operator geometric means [34, 24] combine the changing partitions, while the modular comparison starts from the resolvent-compression identity of Carlen and Vershynina [14], Lemma 2.1. The detailed construction uses these ingredients to compare entropy gain and excitation energy in the same family of states; the next overview explains how that comparison leads to the area bound.

A tensor-network consequence

A projected entangled-pair state (PEPS) is specified by one tensor at each lattice site, with a physical index for that site’s state and one virtual index for each incident edge. Contracting the paired virtual indices gives a many-body vector. The dimension of an edge index is its bond dimension. The approximation problem asks how large these dimensions must be to approximate the ground vector on the original lattice.

The companion [32], Theorem 1.1 proves a polynomial bound for the original open L×LL \times L square grid, L≥2L \ge2, with on-site and nearest-neighbor interactions. For fixed local dimension q≥2q \ge2, term-norm bound J>0J > 0, and global gap Δ>0\Delta> 0, every unique ground vector in this class has a PEPS approximation with maximum bond dimension at most CLcC L^{c} and global vector error at most L−1L^{-1} after normalization and phase choice. The constants depend only on q,J,Δq,J,\Delta. This is an existence result; it does not assert an efficient tensor construction or contraction algorithm.

The approximation uses more than the entropy inequality. This paper also provides positive operators that annihilate the ground vector and have rapidly decaying spatial tails (Proposition 4.3), quantitative information bounds across collars (Propositions 9.6 and 10.2), and two families of geometrically separated regions (Proposition 11.2), with the region shapes and clearances specified in those results. The companion combines these estimates and the geometric ordering with additional compression and routing arguments; its PEPS result is a consequence of that further analysis.

How the proof is organized

Fix the set AA whose entropy is to be bounded, and let ZAZ_A be its crossing-edge endpoints. For disjoint physical regions B,CB,C, write

IΩ(B:C)=SΩ(B)+SΩ(C)−SΩ(B∪C)I_{\Omega}(B:C)=S_{\Omega}(B)+S_{\Omega}(C)-S_{\Omega}(B\cup C)

for their mutual information. Our analytic goal is to make this quantity small when BB lies inside AA and CC is beyond a suitable collar, even when CC includes all of Λ∖A\Lambda\setminus A. Here is why this suffices. Suppose that, after removing a set DD of O(∣∂ΛA∣)O(\lvert\partial_{\Lambda}A\rvert) sites, we can partition AA into two ordered families of regions. If each region shares little information with the complement of AA together with the earlier regions of its own family, two applications of the entropy chain rule cancel all individual region entropies. Purity then bounds SΩ(A)S_{\Omega}(A) by ∣D∣log⁡q\lvert D\rvert\log q and the sum of the information errors. Section 11 constructs regions with the required ordering and separation.

The analytic estimates concern intersections of AA with ambient boxes or finite unions of rectangles and triangles. Their clearance is from ZAZ_A; they may meet holes or the edge of the physical domain. Hamiltonian locality and propagation always use neighborhoods in the induced graph. The argument has five stages.

  1. Obtain a first exponent below volume. Section 3 uses the global gap to bound fluctuations of the negative logarithms of positive marginal eigenvalues. It then optimizes products of positive operators on nested rectangles. Two bounds on the optimized norm, one using the energy estimate and global gap, give a conditional-entropy discount, and hence

SΩ(A∩Q)≤Cr1+e0,e0<1,S_{\Omega}(A\cap Q)\le Cr^{1+e_0},\qquad e_0<1,

for a box QQ of side at most rr sufficiently far from ZAZ_A.

  1. Control information and energy in the same interpolation. Section 4 replaces the Hamiltonian by a sum of positive operators that annihilate Ω\Omega separately, retain a global gap, and have rapidly decaying graph-local tails. Sections 5–7 associate positive operators to partitions of the full system and interpolate between them as a small subsystem changes parts. These operators act on symmetric tensor powers, whose vectors are fixed by every permutation of the copies. Applying an inverse power of the interpolating operator to a vector built from ground-state copies and an auxiliary entangled pair defines the filtered vector whose norm we study. As the copy number grows, logarithmic norms per copy can be compared with combinations of marginal entropies. The decrease of a suitable logarithmic squared norm is bounded below by averaged conditional mutual information, up to a small error. The same transported states bound the energy cost. This common control permits a comparison of information gained with excitation energy spent.

  1. Compare the norms and scan a collar. Section 8 gives two bounds on the negative logarithm of the filtered vector’s norm. Auxiliary dimensions are chosen from a high-probability part of the target’s Schmidt spectrum. Projecting the target and an auxiliary system onto an entangled pair gives the upper bound. The lower bound uses the global gap: low physical energy forces most copies into the ground state. Section 9 moves the partitions through a collar according to a finite randomized schedule. Each interaction is rarely split by a moving boundary, and the schedule supplies an interpolation with sufficiently low energy. The two norm bounds first improve the box exponent repeatedly; their sharper form then gives

IΩ(A∩T:Λ∖(A∩TL))≤Cn1−ε.I_{\Omega}(A\cap T:\Lambda\setminus(A\cap T_L))\le Cn^{1-\varepsilon}.

Here TT is one of the finite unions of controlled rectangles and triangles specified in Definition 9.3, ε>0\varepsilon> 0 is fixed, and TLT_L is the ambient sup-norm enlargement by L=⌊n−ε⌋L = \lfloor n^{-\varepsilon}\rfloor. These targets and their allowed enlargements have O(n)O(n) boundary edges. The entire finite physical and auxiliary system and schedule are fixed before the copy number tends to infinity.

  1. Amplify the information bound. Section 10 uses typical spectral subspaces to construct a candidate operator for restoring a target moved to an auxiliary reference. Its norm is controlled by the collar information. A localized product of contractions derived from the positive constraints suppresses the excited component, and polar decomposition yields a unitary comparison near the target. This unitary leaves both the reference and the remote physical system untouched; comparison with a state in which they are independent bounds their original mutual information. Enlarging the collar by a sublinear radius makes the bound smaller than any prescribed inverse power of nn.

  1. Arrange the regions for entropy cancellation. Section 11 builds the two ordered families described above. The collar around each region avoids the complement of AA and all earlier regions of its own family. Narrow strips and recursive repairs at point contacts produce these separations for arbitrary cuts while leaving only O(∣∂ΛA∣)O(|\partial\Lambda_A|) sites uncovered. The information errors are summable over the regions, so the two entropy chains prove (1.2).

Entropy and induced-graph locality

We record the finite-dimensional conventions and elementary uniform bounds used throughout the proof. Unless specified otherwise, entropies refer to the original ground vector Ω\Omega. A changed state is shown by a subscript. Juxtaposition of disjoint systems denotes their tensor product or their union.

Entropy identities and continuity

For a density matrix ρ\rho on systems DD, EE, FF, define

S(D∣E)ρ=S(DE)ρ−S(E)ρ,I(D:E)ρ=S(D)ρ+S(E)ρ−S(DE)ρ.S(D|E)_\rho= S(DE)_\rho- S(E)_\rho,\qquad I(D:E)_\rho= S(D)_\rho+ S(E)_\rho- S(DE)_\rho.

and

I(D:F∣E)ρ=S(DE)ρ+S(EF)ρ−S(E)ρ−S(DEF)ρ.I(D:F|E)_\rho= S(DE)_\rho+ S(EF)_\rho- S(E)_\rho- S(DEF)_\rho.

We use strong subadditivity, I(D:F∣E)ρ≥0I(D:F|E)_\rho\ge0, for normalized finite-dimensional density operators [27]. It implies that conditioning decreases conditional entropy and that discarding systems cannot increase mutual information. Subadditivity and purification give ∣S(D∣E)∣≤log⁡dim⁡D|S(D|E)| \le\log\dim D. For a pure state the entropies of complementary systems coincide. These facts also hold with empty regions, whose Hilbert spaces are the one-dimensional empty tensor product.

Write h(u)=−ulog⁡u−(1−u)log⁡(1−u)h(u) = -u\log u - (1-u)\log(1-u) for binary entropy. The trace distance of two states is half the trace norm of their difference. The continuity estimate below uses the dimension-independent conditional entropy method of Alicki and Fannes [1], in Winter’s sharpened form [41].

Lemma 2.1 (Continuity with a fixed controlled system). Let ρ,σ\rho,\sigma be density operators on finite-dimensional D⊗ED \otimes E, and put δ=12∥ρ−σ∥≤1\delta= \frac{1}{2}\lVert\rho-\sigma\rVert\le1 and dD=dim⁡Dd_D = \dim D. Then

∣S(D∣E)ρ−S(D∣E)σ∣≤2δlog⁡dD+(1+δ)h(δ1+δ)≤Cδlog⁡(edD).(3)\left|S(D|E)_\rho- S(D|E)_\sigma\right| \le2\delta\log d_D + (1+\delta)h\left(\frac{\delta}{1+\delta}\right) \le C\sqrt{\delta}\log(e d_D). \tag*{(3)}

The same estimates hold for S(D)S(D) by making EE trivial. Summing the bounds for S(D)S(D) and S(D∣E)S(D|E) therefore bounds the continuity cost for I(D:E)I(D:E) in terms of dDd_D, independently of dim⁡E\dim E.

Proof. We include the mixture argument for the bound in [41] Lemma 2. If τ=∑jpjτj\tau=\sum_j p_j\tau_j, adding a classical register that records jj shows

References

  1. [1]Robert Alicki and Mark Fannes. Continuity of quantum conditional information. Journal of Physics A: Mathematical and General, 37(5):L55–L57, 2004.DOI
  2. [2]Anurag Anshu, Itai Arad, and David Gosset. An area law for 2D frustration-free spin systems. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 12–18, 2022.
  3. [3]Anurag Anshu, Itai Arad, and David Gosset. Entanglement subvolume law for 2D frustration-free spin systems. Communications in Mathematical Physics, 393:955–988, 2022.DOI
  4. [4]Anurag Anshu, Itai Arad, and Thomas Vidick. Simple proof of the detectability lemma and spectral gap amplification. Physical Review B, 93:205142, 2016.DOI
  5. [5]Anurag Anshu, Aram W. Harrow, and Mehdi Soleimanifar. Entanglement spread area law in gapped ground states. Nature Physics, 18:1362–1366, 2022.DOI
  6. [6]Itai Arad, Raz Firanko, and Rahul Jain. Area laws and tensor networks for maximally mixed ground states. Communications in Mathematical Physics, 407(3):54, 2026.
  7. [7]Itai Arad, Alexei Kitaev, Zeph Landau, and Umesh Vazirani. An area law and sub-exponential algorithm for 1D systems, 2013.arxiv.org/abs/1301.1162
  8. [8]Itai Arad, Zeph Landau, and Umesh Vazirani. Improved one-dimensional area law for frustration-free systems. Physical Review B, 85:195145, 2012.DOI
  9. [9]Thomas Barthel and Martin Kliesch. Quasi locality and efficient simulation of Markovian quantum dynamics. Physical Review Letters, 108:230504, 2012.DOI
  10. [10]Rajendra Bhatia and K. R. Parthasarathy. Positive definite functions and operator inequalities. Bulletin of the London Mathematical Society, 32(2):214–228, 2000.DOI
  11. [11]Luca Bombelli, Rabinder K. Koul, Joonah Lee, and Rafael D. Sorkin. Quantum source of entropy for black holes. Physical Review D, 34(2):373–383, 1986.pubmed.ncbi.nlm.nih.gov/9957156
  12. [12]Fernando G. S. L. Brandão and Marcus Cramer. Entanglement area law from specific heat capacity. Physical Review B, 92:115134, 2015.DOI
  13. [13]Fernando G. S. L. Brandão and Michał Horodecki. Exponential decay of correlations implies area law. Communications in Mathematical Physics, 333:761–798, 2015.DOI
  14. [14]Eric A. Carlen and Anna Vershynina. Recovery map stability for the data processing inequality. Journal of Physics A: Mathematical and Theoretical, 53(3):035204, 2020. The cited Lemma 2.1 is located in arXiv:1710.02409v3.arxiv.org/abs/1710.02409
  15. [15]Giulio Chiribella. On quantum estimation, quantum cloning and finite quantum de Finetti theorems. In Wim van Dam, Vivien M. Kendon, and Simone Severini, editors, Theory of Quantum Computation, Communication, and Cryptography, volume 6519 of Lecture Notes in Computer Science, pages 9–25. Springer, Berlin, Heidelberg, 2011.DOI
  16. [16]Jaeyoon Cho. Sufficient condition for entanglement area laws in thermodynamically gapped spin systems. Physical Review Letters, 113:197204, 2014.DOI
  17. [17]Matthias Christandl, Robert König, Graeme Mitchison, and Renato Renner. One-and-a-half quantum de Finetti theorems. Communications in Mathematical Physics, 273(2):473–498, 2007.DOI
  18. [18]M. Cramer, J. Eisert, M. B. Plenio, and J. Dreibl. Entanglement-area law for general bosonic harmonic lattice systems. Physical Review A, 73(1):012309, January 2006.DOI
  19. [19]Pavel Etingof, Oleg Golberg, Sebastian Hensel, Tianka Liu, Alex Schwender, Dmitry Vaintrob, and Elena Yudovina. Introduction to Representation Theory, volume 59 of Student Mathematical Library. American Mathematical Society, 2011.
  20. [20]P. J. Forrester and J. R. Ipsen. Selberg integral theory and Mutabil–Borodin ensembles. Advances in Applied Mathematics, 95:152–176, 2018.arxiv.org/abs/1612.06517
  21. [21]M. B. Hastings. An area law for one dimensional quantum systems. Journal of Statistical Mechanics: Theory and Experiment, 2007:P08024, 2007.DOI
  22. [22]Michael Keyl and Reinhard F. Werner. Estimating the spectrum of a density operator. Physical Review A, 64:052311, 2001.
  23. [23]Alexei Kitaev. Anyons in an exactly solved model and beyond. Annals of Physics, 321(1):2–111, 2006.DOI
  24. [24]Fumio Kubo and Tsuyoshi Ando. Means of positive linear operators. Mathematische Annalen, 246(3):205–224, 1980.DOI
  25. [25]Mathieu Lewin, Phan Thành Nam, and Nicolas Rougerie. Remarks on the quantum de Finetti theorem for bosonic systems. Applied Mathematics Research eXpress, 2015(1):48–63, 2015.arxiv.org/abs/1310.2200
  26. [26]Elliott H. Lieb and Derek W. Robinson. The finite group velocity of quantum spin systems. Communications in Mathematical Physics, 28(3):251–257, 1972.
  27. [27]Elliott H. Lieb and Mary Beth Ruskai. Proof of the strong subadditivity of quantum-mechanical entropy. Journal of Mathematical Physics, 14(12):1938–1941, 1973.
  28. [28]Lluís Masanes. Area law for the entropy of low-energy states. Physical Review A, 80:052104, 2009.DOI
  29. [29]Bruno Nachtergaele, Yoshiko Ogata, and Robert Sims. Propagation of correlations in quantum lattice systems. Journal of Statistical Physics, 124:1–13, 2006.DOI
  30. [30]Bruno Nachtergaele and Robert Sims. Lieb–Robinson bounds and the exponential clustering theorem. Communications in Mathematical Physics, 265:119–130, 2006.DOI
  31. [31]Michael Nussbaum and Arleta Szkoła. The Chernoff lower bound for symmetric quantum hypothesis testing. The Annals of Statistics, 37(2):1040–1057, 2009.DOI
  32. [32]OpenAI. Polynomial PEPS approximation of gapped square-grid ground states. OpenAI Math Release preprint OAI:Polynomial-PEPS-approximation-of-gapped-square-grid-ground-states-September-24-2026, 2026.
  33. [33]Dénes Petz. Sufficient subalgebras and the relative entropy of states of a von Neumann algebra. Communications in Mathematical Physics, 105(1):123–131, 1986.DOI
  34. [34]W. Pusz and S. L. Woronowicz. Functional calculus for sesquilinear forms and the purification map. Reports on Mathematical Physics, 8(2):159–170, 1975.DOI
  35. [35]G. A. Raggio and R. F. Werner. Quantum statistical mechanics of general mean field systems. Helvetica Physica Acta, 62(8):980–1003, 1989.DOI
  36. [36]Mark Srednicki. Entropy and area. Physical Review Letters, 71(5):666–669, 1993.DOI
  37. [37]Brian Swingle and John McGreevy. Renormalization group constructions of topological quantum liquids and beyond. Physical Review B, 93:045127, 2016.DOI
  38. [38]Terence Tao. Lecture notes 1 for 247a. UCLA course notes. Lemma 5.10, pp. 13–14. https://www.math.ucla.edu/~tao/247a.1.06f/notes1.pdf.
  39. [39]Karel Van Acoleyen, Michaël Mariën, and Frank Verstraete. Entanglement rates and area laws. Physical Review Letters, 111:170501, 2013.
  40. [40]A. M. Vershik and A. Yu. Okounkov. A new approach to the representation theory of the symmetric groups. II. Journal of Mathematical Sciences, 131(2):5471–5494, 2005.DOI
  41. [41]Andreas Winter. Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints. Communications in Mathematical Physics, 347(1):291–313, 2016.DOI

Paper details

vlnc:W_dec3q9xt
Version
v1 · latest
Published
License
LicenseRef-OpenAI-public
Usage

views · 5

downloads · 1

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

unreleased internal OpenAI model

View statement
Looking for related papers…
Contents