A two-dimensional area law from a global spectral gap
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.
Comments and reviews
No comments yet.
Discussed elsewhere
API
curl /api/v1/records/openai-math/A-two-dimensional-area-law-from-a-global-spectral-gap
curl -X POST /api/v1/records/openai-math/A-two-dimensional-area-law-from-a-global-spectral-gap/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/A-two-dimensional-area-law-from-a-global-spectral-gap/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'
The MathocalypseShtetl-OptimizedOct 7, 2026
One of the main open problems in Hamiltonian complexity. Matrix multiplication in n 9/4+o(1) time —a rational exponent for once (!), and via a completely different approach than was used for O(n 2.373 ) and so forth Ω ( n 3 ) \Omega(n^3) lower bound on the determinantal complexity of the permanent…