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:1905.11337 · Communications in Mathematical Physics

Entanglement Subvolume Law for 2D Frustration-Free Spin Systems

Anurag Anshu, Itai Arad, David Gosset

Published Apr 15, 2022• 4 citations
arXivHTMLPDF
DOI
10.1007/s00220-022-04381-2

Related papers

Frustration and ground state entanglement in 2D lattices

Artur Garcia, José Ignacio Latorre

Bulletin of the American Physical Society•Mar 18, 2013•0 citations

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

Study on low-dimensional quantum spin systems with frustration

洋平 雑賀

•Jan 1, 1995•0 citations

Sub-exponential algorithm for 2D frustration-free spin systems with gapped subsystems

Nilin Abrahamsen

We show that in the setting of the subvolume law of [Anshu, Arad, Gosset '19] for 2D locally gapped frustration-free spin systems there exists a randomized classical algorithm which computes the ground states in sub-exponential time. The running time cannot be improved to polynomial unless SAT can be solved in randomized polynomial time, as even the special case of classical constraint satisfaction problems on the 2D grid is known to be NP-hard.

•Apr 6, 2020•1 citation

Properties of entanglement in interacting spin systems

Rosario Fazio, Chiara Macchiavello

Annalen der Physik•Jan 10, 2005•4 citations

Improved one-dimensional area law for frustration-free systems

Itai Arad, Zeph A. Landau, Umesh V. Vazirani

We present a new proof for the 1D area law for frustration-free systems with a constant gap, which exponentially improves the entropy bound in Hastings\^a 1D area law and which is tight to within a polynomial factor. For particles of dimension $d$, spectral gap $\ensuremath{\epsilon}>0$, and interaction strength at most $J$, our entropy bound is ${S}_{1D}\ensuremath{\le}\mathcal{O}(1)\ifmmode\cdot\else\textperiodcentered\fi{}{X}^{3}{\mathrm{log}}^{8}X$, where $X\stackrel{\mathrm{def}}{=}(J\mathrm{log}d)/\ensuremath{\epsilon}$. Our proof is completely combinatorial, combining the detectability lemma with basic tools from approximation theory. In higher dimensions, when the bipartitioning area is $|\ensuremath{\partial}L|$, we use additional local structure in the proof and show that $S\ensuremath{\le}\mathcal{O}(1)\ifmmode\cdot\else\textperiodcentered\fi{}{|\ensuremath{\partial}L|}^{2}{\mathrm{log}}^{6}|\ensuremath{\partial}L|\ifmmode\cdot\else\textperiodcentered\fi{}{X}^{3}{\mathrm{log}}^{8}X$. This is at the cusp of being nontrivial in the 2D case, in the sense that any further improvement would yield a subvolume law.

arXiv:1111.2970•Physical Review B•May 29, 2012•77 citations
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 present a new proof for the 1D area law for frustration-free systems with a constant gap, which exponentially improves the entropy bound in Hastings\^a 1D area law and which is tight to within a polynomial factor. For particles of dimension ddd, spectral gap $\ensuremath{\epsilon}>0$, and interaction strength at most JJJ, our entropy bound is ${S}_{1D}\ensuremath{\le}\mathcal{O}(1)\ifmmode\cdot\else\textperiodcentered\fi{}{X}^{3}{\mathrm{log}}^{8}X$, where $X\stackrel{\mathrm{def}}{=}(J\mathrm{log}d)/\ensuremath{\epsilon}$. Our proof is completely combinatorial, combining the detectability lemma with basic tools from approximation theory. In higher dimensions, when the bipartitioning area is $|\ensuremath{\partial}L|$, we use additional local structure in the proof and show that $S\ensuremath{\le}\mathcal{O}(1)\ifmmode\cdot\else\textperiodcentered\fi{}{|\ensuremath{\partial}L|}^{2}{\mathrm{log}}^{6}|\ensuremath{\partial}L|\ifmmode\cdot\else\textperiodcentered\fi{}{X}^{3}{\mathrm{log}}^{8}X$. This is at the cusp of being nontrivial in the 2D case, in the sense that any further improvement would yield a subvolume law.