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

arXiv:2610.15199

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

Tomotaka Kuwahara

quant-phcond-mat.dis-nncond-mat.stat-mechmath-phSubmitted Oct 10, 2026• Announced Oct 13, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether locality and a uniform spectral gap enforce entanglement area laws for every fixed Rényi index $0<\alpha<1$ in higher dimensions, and determines the worst-case accuracy dependence of approximate ground-state projector (AGSP) Schmidt rank. It constructs finite-range lattice Hamiltonians with local dimension at most six, bounded interaction strength, unique ground states and a size-independent gap. For every fixed $0<\alpha<1$ and spatial dimension $\nu\ge2$, suitable families have $S_\alpha=\Omega(n)$ while $S_1=O(\mathcal A)$. In two dimensions the rectangular aspect ratio depends on $\alpha$; in dimensions at least three, one hypercubic family works for every fixed $\alpha<1$. These states admit uniformly gapped local paths from product states. The construction uses parallel history-state rows, local activation constraints and one attractive root well. A fixed product projection extracts $Mm$ Bell pairs with probability at least $\exp[-C(M+\sqrt M\,m^{3/2})]$. This small-weight sector yields both Rényi volume laws and approximation-rank lower bounds. At fixed gap and $\log(1/\epsilon)\gtrsim\mathcal A$, the worst-case AGSP rank satisfies $\log D=\widetilde\Theta[(\mathcal A\log(1/\epsilon))^{2/3}]$. The matching upper bound combines regional energy projection, Chebyshev filtering and a cut-count decomposition. Optimality concerns approximate, not exactly ground-state-preserving, AGSPs, with lower-bound system sizes selected for the target accuracy. Gap dependence and matching lower bounds at all accuracies remain open. The results do not establish efficient global tensor-network construction or perturbative stability of the Rényi volume law, and do not resolve the general higher-dimensional von Neumann area-law question.

No sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
7 pages + 25 pages appendix, 6 figures

Related papers

1D area law with ground-state degeneracy

Yichen Huang

An area law is proved for the Renyi entanglement entropy of possibly degenerate ground states in one-dimensional gapped quantum systems. Suppose in a chain of $n$ spins the ground states of a local Hamiltonian with energy gap $\epsilon$ are constant-fold degenerate. Then, the Renyi entanglement entropy $R_\alpha(0<\alpha<1)$ of any ground state across any cut is upper bounded by $\tilde O(\alpha^{-3}/\epsilon)$, and any ground state can be well approximated by a matrix product state of subpolynomial bond dimension $2^{\tilde O(\epsilon^{-1/4}\log^{3/4}n)}$.

•Mar 3, 2014•1 citation

A two-dimensional area law from a global spectral gap

OpenAI

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.

•Oct 6, 2026•0 citations

An area law for one-dimensional quantum systems

M. B. Hastings

We prove an area law for the entanglement entropy in gapped one-dimensional quantum systems. The bound on the entropy grows surprisingly rapidly with the correlation length; we discuss this in terms of properties of quantum expanders and present a conjecture on matrix product states which may provide an alternate way of arriving at an area law. We also show that, for gapped, local systems, the bound on Von Neumann entropy implies a bound on Rényi entropy for sufficiently large α<1 and implies the ability to approximate the ground state by a matrix product state.

arXiv:0705.2024•Journal of Statistical Mechanics Theory and Experiment•Aug 20, 2007•1,263 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

An area law and sub-exponential algorithm for 1D systems

Arad, Itai, Kitaev, Alexei, Landau, Zeph +1 more

We give a new proof for the area law for general 1D gapped systems, which exponentially improves Hastings' famous result \cite{ref:Has07}. Specifically, we show that for a chain of d-dimensional spins, governed by a 1D local Hamiltonian with a spectral gap \eps>0, the entanglement entropy of the ground state with respect to any cut in the chain is upper bounded by $O{\frac{\log^3 d}{\eps}}$. Our approach uses the framework Arad et al to construct a Chebyshev-based AGSP (Approximate Ground Space Projection) with favorable factors. However, our construction uses the Hamiltonian directly, instead of using the Detectability lemma, which allows us to work with general (frustrated) Hamiltonians, as well as slightly improving the $1/\eps$ dependence of the bound in Arad et al. To achieve that, we establish a new, "random-walk like", bound on the entanglement rank of an arbitrary power of a 1D Hamiltonian, which might be of independent interest: \ER{H^\ell} \le (\ell d)^{O(\sqrt{\ell})}. Finally, treating d as a constant, our AGSP shows that the ground state is well approximated by a matrix product state with a sublinear bond dimension $B=e^{O(\log^{3/4}n/\eps^{1/4})}. Using this in conjunction with known dynamical programing algorithms, yields an algorithm for a 1/\poly(n) approximation of the ground energy with a subexponential running time T\le \exp(e^{O(\log^{3/4}n/\eps^{1/4})}).

arXiv:1301.1162•Jan 7, 2013•215 citations

Quantum matter is weakly entangled at low energies

Samuel J. Garratt, Dmitry A. Abanin

We construct upper bounds on entanglement entropies of many-body quantum states that have fixed energy expectation values with respect to local Hamiltonians. Our focus is on entanglement entropies of subsystems that make up approximately half of the full system. The upper bound on the von Neumann entanglement entropy is half the sum of the thermal entropies of two fictitious systems at the same temperature as one another, with an additional area-law contribution in some systems. The effective temperature is chosen such that the sum of the thermal energies of the two fictitious systems matches the constraint on the energy of the state in the original problem; at subextensive energies, this temperature decreases with increasing system size. Our upper bounds on Rényi entanglement entropies take an analogous form. These inequalities show that, in systems that are frustration-free (FF) and whose zero-temperature subsystem thermal entropies scale with surface areas (rather than subsystem volumes), ground states are area-law entangled. For physical models of quantum matter, which have well-defined specific heat capacities (and are not necessarily FF), our bounds provide a way to convert this thermodynamic data into constraints on pure-state entanglement at both subextensive and extensive energies. We also show that our general upper bounds on half-system entanglement entropies are optimal, up to subleading corrections, in systems with reflection symmetry and above a subextensive energy threshold. A key application of our results is to constrain the entanglement of quantum states relevant to simulations of zero-temperature response functions, which have energies of order unity. We prove that, in wide varieties of FF systems in two dimensions and higher, the contributions of excitations to von Neumann entanglement entropy are subleading compared with the contribution from the ground state.

cond-mat.stat-mechCross-listedarXiv:2604.14143•PRX Quantum•Apr 16, 2026•1 citation
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.
The paper asks whether locality and a uniform spectral gap enforce entanglement area laws for every fixed Rényi index 0<α<10<\alpha<10<α<1 in higher dimensions, and determines the worst-case accuracy dependence of approximate ground-state projector (AGSP) Schmidt rank.
It constructs finite-range lattice Hamiltonians with local dimension at most six, bounded interaction strength, unique ground states and a size-independent gap. For every fixed 0<α<10<\alpha<10<α<1 and spatial dimension ν≥2\nu\ge2ν≥2, suitable families have Sα=Ω(n)S_\alpha=\Omega(n)Sα​=Ω(n) while S1=O(A)S_1=O(\mathcal A)S1​=O(A). In two dimensions the rectangular aspect ratio depends on α\alphaα; in dimensions at least three, one hypercubic family works for every fixed α<1\alpha<1α<1. These states admit uniformly gapped local paths from product states.
The construction uses parallel history-state rows, local activation constraints and one attractive root well. A fixed product projection extracts MmMmMm Bell pairs with probability at least exp⁡[−C(M+M m3/2)]\exp[-C(M+\sqrt M\,m^{3/2})]exp[−C(M+M​m3/2)]. This small-weight sector yields both Rényi volume laws and approximation-rank lower bounds. At fixed gap and log⁡(1/ϵ)≳A\log(1/\epsilon)\gtrsim\mathcal Alog(1/ϵ)≳A, the worst-case AGSP rank satisfies log⁡D=Θ~[(Alog⁡(1/ϵ))2/3]\log D=\widetilde\Theta[(\mathcal A\log(1/\epsilon))^{2/3}]logD=Θ[(Alog(1/ϵ))2/3]. The matching upper bound combines regional energy projection, Chebyshev filtering and a cut-count decomposition.
Optimality concerns approximate, not exactly ground-state-preserving, AGSPs, with lower-bound system sizes selected for the target accuracy. Gap dependence and matching lower bounds at all accuracies remain open. The results do not establish efficient global tensor-network construction or perturbative stability of the Rényi volume law, and do not resolve the general higher-dimensional von Neumann area-law question.
An area law is proved for the Renyi entanglement entropy of possibly degenerate ground states in one-dimensional gapped quantum systems. Suppose in a chain of nnn spins the ground states of a local Hamiltonian with energy gap ϵ\epsilonϵ are constant-fold degenerate. Then, the Renyi entanglement entropy Rα(0<α<1)R_\alpha(0<\alpha<1)Rα​(0<α<1) of any ground state across any cut is upper bounded by O~(α−3/ϵ)\tilde O(\alpha^{-3}/\epsilon)O~(α−3/ϵ), and any ground state can be well approximated by a matrix product state of subpolynomial bond dimension 2O~(ϵ−1/4log⁡3/4n)2^{\tilde O(\epsilon^{-1/4}\log^{3/4}n)}2O~(ϵ−1/4log3/4n).
We prove an area law for the entanglement entropy in gapped one-dimensional quantum systems. The bound on the entropy grows surprisingly rapidly with the correlation length; we discuss this in terms of properties of quantum expanders and present a conjecture on matrix product states which may provide an alternate way of arriving at an area law. We also show that, for gapped, local systems, the bound on Von Neumann entropy implies a bound on Rényi entropy for sufficiently large α<1 and implies the ability to approximate the ground state by a matrix product state.
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 give a new proof for the area law for general 1D gapped systems, which exponentially improves Hastings' famous result \cite{ref:Has07}. Specifically, we show that for a chain of d-dimensional spins, governed by a 1D local Hamiltonian with a spectral gap \eps>0, the entanglement entropy of the ground state with respect to any cut in the chain is upper bounded by $O{\frac{\log^3 d}{\eps}}$. Our approach uses the framework Arad et al to construct a Chebyshev-based AGSP (Approximate Ground Space Projection) with favorable factors. However, our construction uses the Hamiltonian directly, instead of using the Detectability lemma, which allows us to work with general (frustrated) Hamiltonians, as well as slightly improving the $1/\eps$ dependence of the bound in Arad et al. To achieve that, we establish a new, "random-walk like", bound on the entanglement rank of an arbitrary power of a 1D Hamiltonian, which might be of independent interest: \ER{H^\ell} \le (\ell d)^{O(\sqrt{\ell})}. Finally, treating d as a constant, our AGSP shows that the ground state is well approximated by a matrix product state with a sublinear bond dimension $B=e^{O(\log^{3/4}n/\eps^{1/4})}. Using this in conjunction with known dynamical programing algorithms, yields an algorithm for a 1/\poly(n) approximation of the ground energy with a subexponential running time T\le \exp(e^{O(\log^{3/4}n/\eps^{1/4})}).
We construct upper bounds on entanglement entropies of many-body quantum states that have fixed energy expectation values with respect to local Hamiltonians. Our focus is on entanglement entropies of subsystems that make up approximately half of the full system. The upper bound on the von Neumann entanglement entropy is half the sum of the thermal entropies of two fictitious systems at the same temperature as one another, with an additional area-law contribution in some systems. The effective temperature is chosen such that the sum of the thermal energies of the two fictitious systems matches the constraint on the energy of the state in the original problem; at subextensive energies, this temperature decreases with increasing system size. Our upper bounds on Rényi entanglement entropies take an analogous form. These inequalities show that, in systems that are frustration-free (FF) and whose zero-temperature subsystem thermal entropies scale with surface areas (rather than subsystem volumes), ground states are area-law entangled. For physical models of quantum matter, which have well-defined specific heat capacities (and are not necessarily FF), our bounds provide a way to convert this thermodynamic data into constraints on pure-state entanglement at both subextensive and extensive energies. We also show that our general upper bounds on half-system entanglement entropies are optimal, up to subleading corrections, in systems with reflection symmetry and above a subextensive energy threshold. A key application of our results is to constrain the entanglement of quantum states relevant to simulations of zero-temperature response functions, which have energies of order unity. We prove that, in wide varieties of FF systems in two dimensions and higher, the contributions of excitations to von Neumann entanglement entropy are subleading compared with the contribution from the ground state.