Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A two-dimensional area law from a global spectral gap

OpenAI

Published Oct 6, 2026• 0 citations
Publisher

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.

DOI
10.83295/cqdm-wk37

Related papers

Entanglement subvolume law for 2d frustration-free spin systems

Anurag Anshu, Itai Arad, David Gosset

Let H be a frustration-free Hamiltonian describing a 2D grid of qudits with local interactions, a unique ground state, and local spectral gap lower bounded by a positive constant. For any bipartition defined by a vertical cut of length L running from top to bottom of the grid, we prove that the corresponding entanglement entropy of the ground state of H is upper bounded by Õ(L 5/3). For the special case of a 1D chain, our result provides a new area law which improves upon prior work, in terms of the scaling with qudit dimension and spectral gap. In addition, for any bipartition of the grid into a rectangular region A and its complement, we show that the entanglement entropy is upper bounded as Õ(|∂ A|5/3) where ∂ A is the boundary of A. This represents a subvolume bound on entanglement in frustration-free 2D systems. In contrast with previous work, our bounds depend on the local (rather than global) spectral gap of the Hamiltonian. We prove our results using a known method which bounds the entanglement entropy of the ground state in terms of certain properties of an approximate ground state projector (AGSP). To this end, we construct a new AGSP which is based on a robust polynomial approximation of the AND function and we show that it achieves an improved trade-off between approximation error and entanglement.

ACM Symposium on Theory of Computing (STOC)•Jun 7, 2020•14 citations

Entanglement vs. gap for one-dimensional spin systems

Matthew B. Hastings, Dorit Aharonov, Daniel Gottesman

We study the relationship between entanglement and spectral gap for local Hamiltonians in one dimension. The area law for a one-dimensional system states that for the ground state, the entanglement of any interval is upper-bounded by a constant independent of the size of the interval. However, the possible dependence of the upper bound on the spectral gap {Delta} is not known, as the best known general upper bound is asymptotically much larger than the largest possible entropy of any model system previously constructed for small {Delta}. To help resolve this asymptotic behavior, we construct a family of one-dimensional local systems for which some intervals have entanglement entropy which is polynomial in 1/{Delta}, whereas previously studied systems had the entropy of all intervals bounded by a constant times log(1/{Delta}).

Journal of Mathematical Physics•Jan 1, 2008•1 citation

The Rényi area law conjecture is false below $α=1$ in high dimensions

Tomotaka Kuwahara

Area laws express the expectation that entanglement in gapped quantum ground states scales with a boundary rather than a volume. In one dimension this holds for every Rényi entropy, and the Rényi area-law conjecture asserts the same in higher dimensions for each fixed $0<α<1$. Here we disprove this conjecture in every spatial dimension two and higher. We construct finite-range Hamiltonians with fixed local dimension, bounded interaction strength, unique ground states and a uniform spectral gap, whose ground states exhibit volume-law Rényi entanglement while obeying a von Neumann area law and remaining connected to product states through uniformly gapped local paths. The mechanism is error-space complexity: locally identifiable components of arbitrarily small weight can encode states with high entanglement complexity. We also establish the worst-case rank-error trade-off for approximate ground-state projectors, a key tool in one-dimensional area-law proofs. At fixed gap, the optimal Schmidt rank at projection error $ε$ across a planar cut of cross-section $A$ scales as $\exp[\tildeΘ((A\logε^{-1})^{2/3})]$ when $\logε^{-1}\gtrsim A$. Thus $α=1$ is the sharp threshold for a universal Rényi area law within this adiabatically connected class.

quant-pharXiv:2610.15199•Oct 13, 2026•0 citations

Entanglement versus gap for one-dimensional spin systems

Daniel Gottesman, M. B. Hastings

We study the relationship between entanglement and spectral gap for local Hamiltonians in one dimension (1D). The area law for a 1D system states that for the ground state, the entanglement of any interval is upper bounded by a constant independent of the size of the interval. However, the possible dependence of the upper bound on the spectral gap Δ is not known, as the best known general upper bound is asymptotically much larger than the largest possible entropy of any model system previously constructed for small Δ. To help resolve this asymptotic behavior, we construct a family of 1D local systems for which some intervals have entanglement entropy, which is polynomial in 1/Δ, whereas previously studied systems, such as free fermion systems or systems described by conformal field theory, had the entropy of all intervals bounded by a constant time log(1/Δ).

arXiv:0901.1108•New Journal of Physics•Feb 26, 2010•70 citations

Quantum complexity and generalized area law in fully connected models

Donghoon Kim, Tomotaka Kuwahara

The area law for entanglement entropy captures a fundamental constraint on the complexity of quantum many-body ground states and enables their efficient description. While the area law is rigorously established in one dimension, its status in higher-dimensional local systems remains unresolved, and it does not hold in general for geometrically non-local systems. Here, we establish a generalized area law for gapped ground states of fully connected Hamiltonians. We show that the bipartite entanglement entropy grows at most logarithmically with system size despite the absence of geometric locality. In the ground state, each site is only weakly entangled with the rest, while configurations with extensive local fluctuations are strongly suppressed, effectively restricting the accessible Hilbert space. As a consequence, the ground state admits a matrix product state approximation with polynomial bond dimension with respect to the system size at fixed accuracy. In the permutation-invariant setting, we further prove a constant entanglement bound and demonstrate that the gapped ground state can be computed in time polylogarithmic in the system size. These results show that low entanglement complexity need not rely on geometric locality, broadening the conceptual and computational scope of area laws.

arXiv:2411.02140•Nov 4, 2024•5 citations

Ground state entanglement in one-dimensional translationally invariant quantum systems

Sandy Irani

We examine whether it is possible for one-dimensional translationally invariant Hamiltonians to have ground states with a high degree of entanglement. We present a family of translationally invariant Hamiltonians {Hn} for the infinite chain. The spectral gap of Hn is Ω(1/poly(n)). Moreover, for any state in the ground space of Hn and any m, there are regions of size m with entanglement entropy Ω(min{m,n}). A similar construction yields translationally invariant Hamiltonians for finite chains that have unique ground states exhibiting high entanglement. The area law proven by Hastings [“An area law for one dimensional quantum systems,” J. Stat. Mech.: Theory Exp. 2007 (08024)] gives a constant upper bound on the entanglement entropy for one-dimensional ground states that is independent of the size of the region but exponentially dependent on 1/Δ, where Δ is the spectral gap. This paper provides a lower bound, showing a family of Hamiltonians for which the entanglement entropy scales polynomially with 1/Δ. Previously, the best known such bound was logarithmic in 1/Δ.

arXiv:0901.1107•Journal of Mathematical Physics•Feb 1, 2010•45 citations
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.
Let H be a frustration-free Hamiltonian describing a 2D grid of qudits with local interactions, a unique ground state, and local spectral gap lower bounded by a positive constant. For any bipartition defined by a vertical cut of length L running from top to bottom of the grid, we prove that the corresponding entanglement entropy of the ground state of H is upper bounded by Õ(L 5/3). For the special case of a 1D chain, our result provides a new area law which improves upon prior work, in terms of the scaling with qudit dimension and spectral gap. In addition, for any bipartition of the grid into a rectangular region A and its complement, we show that the entanglement entropy is upper bounded as Õ(|∂ A|5/3) where ∂ A is the boundary of A. This represents a subvolume bound on entanglement in frustration-free 2D systems. In contrast with previous work, our bounds depend on the local (rather than global) spectral gap of the Hamiltonian. We prove our results using a known method which bounds the entanglement entropy of the ground state in terms of certain properties of an approximate ground state projector (AGSP). To this end, we construct a new AGSP which is based on a robust polynomial approximation of the AND function and we show that it achieves an improved trade-off between approximation error and entanglement.
We study the relationship between entanglement and spectral gap for local Hamiltonians in one dimension. The area law for a one-dimensional system states that for the ground state, the entanglement of any interval is upper-bounded by a constant independent of the size of the interval. However, the possible dependence of the upper bound on the spectral gap {Delta} is not known, as the best known general upper bound is asymptotically much larger than the largest possible entropy of any model system previously constructed for small {Delta}. To help resolve this asymptotic behavior, we construct a family of one-dimensional local systems for which some intervals have entanglement entropy which is polynomial in 1/{Delta}, whereas previously studied systems had the entropy of all intervals bounded by a constant times log(1/{Delta}).
The Rényi area law conjecture is false below α=1α=1α=1 in high dimensions
Area laws express the expectation that entanglement in gapped quantum ground states scales with a boundary rather than a volume. In one dimension this holds for every Rényi entropy, and the Rényi area-law conjecture asserts the same in higher dimensions for each fixed 0<α<10<α<10<α<1. Here we disprove this conjecture in every spatial dimension two and higher. We construct finite-range Hamiltonians with fixed local dimension, bounded interaction strength, unique ground states and a uniform spectral gap, whose ground states exhibit volume-law Rényi entanglement while obeying a von Neumann area law and remaining connected to product states through uniformly gapped local paths. The mechanism is error-space complexity: locally identifiable components of arbitrarily small weight can encode states with high entanglement complexity. We also establish the worst-case rank-error trade-off for approximate ground-state projectors, a key tool in one-dimensional area-law proofs. At fixed gap, the optimal Schmidt rank at projection error εεε across a planar cut of cross-section AAA scales as exp⁡[Θ~((Alog⁡ε−1)2/3)]\exp[\tildeΘ((A\logε^{-1})^{2/3})]exp[Θ~((Alogε−1)2/3)] when log⁡ε−1≳A\logε^{-1}\gtrsim Alogε−1≳A. Thus α=1α=1α=1 is the sharp threshold for a universal Rényi area law within this adiabatically connected class.
We study the relationship between entanglement and spectral gap for local Hamiltonians in one dimension (1D). The area law for a 1D system states that for the ground state, the entanglement of any interval is upper bounded by a constant independent of the size of the interval. However, the possible dependence of the upper bound on the spectral gap Δ is not known, as the best known general upper bound is asymptotically much larger than the largest possible entropy of any model system previously constructed for small Δ. To help resolve this asymptotic behavior, we construct a family of 1D local systems for which some intervals have entanglement entropy, which is polynomial in 1/Δ, whereas previously studied systems, such as free fermion systems or systems described by conformal field theory, had the entropy of all intervals bounded by a constant time log(1/Δ).
The area law for entanglement entropy captures a fundamental constraint on the complexity of quantum many-body ground states and enables their efficient description. While the area law is rigorously established in one dimension, its status in higher-dimensional local systems remains unresolved, and it does not hold in general for geometrically non-local systems. Here, we establish a generalized area law for gapped ground states of fully connected Hamiltonians. We show that the bipartite entanglement entropy grows at most logarithmically with system size despite the absence of geometric locality. In the ground state, each site is only weakly entangled with the rest, while configurations with extensive local fluctuations are strongly suppressed, effectively restricting the accessible Hilbert space. As a consequence, the ground state admits a matrix product state approximation with polynomial bond dimension with respect to the system size at fixed accuracy. In the permutation-invariant setting, we further prove a constant entanglement bound and demonstrate that the gapped ground state can be computed in time polylogarithmic in the system size. These results show that low entanglement complexity need not rely on geometric locality, broadening the conceptual and computational scope of area laws.
We examine whether it is possible for one-dimensional translationally invariant Hamiltonians to have ground states with a high degree of entanglement. We present a family of translationally invariant Hamiltonians {Hn} for the infinite chain. The spectral gap of Hn is Ω(1/poly(n)). Moreover, for any state in the ground space of Hn and any m, there are regions of size m with entanglement entropy Ω(min{m,n}). A similar construction yields translationally invariant Hamiltonians for finite chains that have unique ground states exhibiting high entanglement. The area law proven by Hastings [“An area law for one dimensional quantum systems,” J. Stat. Mech.: Theory Exp. 2007 (08024)] gives a constant upper bound on the entanglement entropy for one-dimensional ground states that is independent of the size of the region but exponentially dependent on 1/Δ, where Δ is the spectral gap. This paper provides a lower bound, showing a family of Hamiltonians for which the entanglement entropy scales polynomially with 1/Δ. Previously, the best known such bound was logarithmic in 1/Δ.