An area law for 2d frustration-free spin systems
Anurag Anshu, Itai Arad, David Gosset
Abstract
We prove that the entanglement entropy of the ground state of a locally gapped frustration-free 2D lattice spin system satisfies an area law with respect to a vertical bipartition of the lattice into left and right regions. We first establish that the ground state projector of any locally gapped frustration-free 1D spin system can be approximated to within error ǫ by a degree O( n log(ǫ -1 )) multivariate polynomial in the interaction terms of the Hamiltonian. This generalizes the optimal bound on the approximate degree of the boolean AND function, which corresponds to the special case of commuting Hamiltonian terms. For 2D spin systems we then construct an approximate ground state projector (AGSP) that employs the optimal 1D approximation in the vicinity of the boundary of the bipartition of interest. This AGSP has sufficiently low entanglement and error to establish the area law using a known technique.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 600ce83d-2ae3-48a9-821e-27eae94ca7a1Cited by top-tier papers3
- NLTS Hamiltonians from Good Quantum CodesAnurag Anshu, Nikolas P. Breuckmann, Chinmay NirkheSTOC 2023 · 50 citations
- High-Temperature Gibbs States are Unentangled and Efficiently PreparableAinesh Bakshi, Allen Liu, Ankur Moitra, Ewin TangFOCS 2024 · 15 citations
- Fast Mixing of Quantum Spin Chains at All TemperaturesThiago Bergamaschi, Chi-Fang ChenSTOC 2026 · 13 citations
Builds on1
Related papers
- An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSPItai Arad, Raz Firanko, Rahul JainSTOC 2024 · 2 citations
- Tight Lipschitz Hardness for optimizing Mean Field Spin GlassesBrice Huang, Mark SellkeFOCS 2022 · 21 citations
- The State Hidden Subgroup Problem and an Efficient Algorithm for Locating UnentanglementAdam Bouland, Tudor Giurgica-Tiron, John WrightSTOC 2025 · 2 citations
- Low-Degree Hardness of Random Optimization ProblemsDavid Gamarnik, Aukosh Jagannath, Alexander S. WeinFOCS 2020 · 48 citations
- On the hardness of finding balanced independent sets in random bipartite graphsWill Perkins, Yuzhou WangSODA 2024 · 2 citations
