arXiv:2609.40220
NLTM Hamiltonians from gauged sheaf quantum locally testable codes
Fuchuan Wei, Zhengyi Han, Zimu Li, Zi-Wen Liu
Abstract
Understanding the complexity of low-energy quantum states is a central problem in quantum complexity theory and many-body physics. Here we prove the no low-energy trivial magic (NLTM) conjecture, constructing a family of local Hamiltonians for which every state within a positive energy density window requires circuit depth $Ω(\log n)$ to prepare from arbitrary stabilizer state that may themselves be highly entangled. Notably, our result is intrinsic in the sense that the same Hamiltonian family and energy density threshold apply to arbitrary qudit stabilizer inputs with any bounded local dimensions. Our construction builds on non-Abelian gauged sheaf codes obtained using the cup product structure on good quantum locally testable codes. We establish constant operator soundness for the associated Hamiltonians, enabling their protected logical structure to constrain all states at sufficiently low energy density. By excluding shallow stabilizer-based classical witnesses, Our result substantially strengthens NLTS and advances our understanding of low-energy complexity relevant to quantum PCP.
AI Summary
The paper addresses whether local Hamiltonians can exclude not only shallow preparation from product states (NLTS), but also shallow preparation from arbitrary, potentially highly entangled stabilizer states. It proves a no low-energy trivial magic (NLTM) theorem, including an “intrinsic” version that permits stabilizer inputs on qudits of any fixed bounded dimension. The main construction gives frustration-free qubit Hamiltonians with $\Theta(N)$ bounded-locality, bounded-degree terms and a constant energy-density threshold independent of the input dimension bound. Every state below this threshold requires depth $\Omega(\log N)$ after the stabilizer input. Circuits have arbitrary connectivity and two-qudit gates; unrestricted finite stabilizer ancillas, discarded outputs, and finite classical mixtures are allowed. The general criterion gives the explicit bound $D>\tfrac15\log N-\tfrac15\log\log d_{\max}-c$ when $d_{\max}$ is smaller than a specified prime divisor of the ground-space dimension. The proof combines linear code distance, constant operator soundness, and ground-space degeneracy with a growing prime factor. Stabilizer completion and Chebyshev projector approximation force a divisibility relation incompatible with stabilizer-code dimensions. Non-Abelian cup-product gauging of sheaf qLTCs supplies nonadditive codes satisfying these conditions, also with positive coding rate. A separate construction embeds ternary Tanner codes into qubits and derives binary NLTM from a linear energy barrier. It does not give intrinsic NLTM: some ground states have depth-two preparation from qutrit stabilizer inputs. The results exclude a particular class of classical low-energy witnesses, not all such witnesses, and do not establish quantum PCP; broader witness models and alternative structural criteria remain open.
Central claim may not hold: The intrinsic NLTM construction relies on linear degree-one homological distance for blocks A and B to control uncorrectable dressed-X eigenspaces, but the stated degree-two code distances and expansion bounds do not establish that additional property.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.