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:2609.40220

NLTM Hamiltonians from gauged sheaf quantum locally testable codes

Fuchuan Wei, Zhengyi Han, Zimu Li, Zi-Wen Liu

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

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.

Little sign of AI-generated text

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.

Related papers

Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians

Anurag Anshu, Chinmay Nirkhe

The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings, 2014 -- which posits the existence of a local Hamiltonian with a super-constant quantum circuit lower bound on the complexity of all low-energy states -- identifies a fundamental obstacle to the resolution of the quantum PCP conjecture. In this work, we provide new techniques, based on entropic and local indistinguishability arguments, that prove circuit lower bounds for all the low-energy states of local Hamiltonians arising from quantum error-correcting codes. For local Hamiltonians arising from nearly linear-rate or nearly linear-distance LDPC stabilizer codes, we prove super-constant circuit lower bounds for the complexity of all states of energy o(n). Such codes are known to exist and are not necessarily locally testable, a property previously suspected to be essential for the NLTS conjecture. Curiously, such codes can also be constructed on a two-dimensional lattice, showing that low-depth states cannot accurately approximate the ground-energy even in physically relevant systems.

arXiv:2011.02044•Leibniz international proceedings in informatics•Nov 3, 2020•19 citations

Non-Abelian sheaf quantum LDPC codes: good and magical

Zimu Li, Fuchuan Wei, Zhengyi Han +1 more

Non-Abelian quantum codes connect quantum error correction, phases of matter, and computational resources. In this work, we develop a general framework for constructing non-Abelian quantum low-density parity-check (qLDPC) codes by gauging sheaf codes via cup products and use it to establish code families with constant encoding rate and linear distance, simultaneously achieving optimal asymptotic scaling in both parameters. In particular, we characterize explicit logical representatives of the full gauged code space, and provide a fundamental treatment of non-Abelian code distance in the sense of Knill--Laflamme based on combining expansion with cleaning to establish protection against arbitrary errors. We further construct an almost-good family with entire code spaces exhibiting long-range magic. Moreover, we use linearly addressable cup product to directly generate linearly many encoded magic states from gauging measurements of Clifford operators. These results extend good qLDPC codes beyond the Pauli stabilizer setting, lay the foundation for pursuing the no low-energy trivial magic conjecture and shed light on non-Abelian quantum phases and orders beyond geometric locality.

quant-pharXiv:2609.30159•Sep 25, 2026•3 citations

Circuit lower bounds for quantum code Hamiltonians and an almost linear NLTS theorem

Anurag Anshu, Chinmay Nirkhe

The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings (Quantum Information and Computation, 2014) -- which posits the existence of a local Hamiltonian with a super-constant circuit lower bound on the complexity of all low-energy states -- identifies a fundamental obstacle to the resolution of the quantum PCP conjecture. In this paper, we provide new techniques, based on entropic and local indistinguishability arguments, for proving circuit lower bounds for the low-energy states of local Hamiltonians arising from quantum error-correcting codes. For local Hamiltonians arising from nearly linear-rate and polynomial-distance LDPC stabilizer codes, we prove a super-constant circuit lower bounds for the complexity of all states of energy o(n) (which can be viewed as an almost linear NLTS theorem). Such codes are known to exist and, in general, are not locally-testable, a property previously suspected to be essential for the NLTS conjecture. Curiously, such codes can also be constructed on a constant-dimensional lattice, showing that complex entanglement at high energies can persist in physically relevant systems.

•Nov 3, 2020•0 citations

NLTS Hamiltonians from Good Quantum Codes

Anurag Anshu, Nikolas P. Breuckmann, Chinmay Nirkhe

The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings posits that there exist families of Hamiltonians with all low energy states of non-trivial complexity (with complexity measured by the quantum circuit depth preparing the state). We prove this conjecture by showing that a particular family of constant-rate and linear-distance qLDPC codes correspond to NLTS local Hamiltonians, although we believe this to be true for all current constructions of good qLDPC codes.

ACM Symposium on Theory of Computing (STOC)•May 16, 2023•73 citations

Theory of (Co)homological Invariants on Quantum LDPC Codes

Zimu Li, Yuguo Shao, Fuchuan Wei +2 more

We establish a systematic mathematical framework for constructing and computing (co)homological invariants that induce logical gates on quantum low-density parity-check (qLDPC) codes. By synthesizing tools from graph theory, algebraic topology, and number theory, we study constructions ranging from hypergraph product (HGP) codes to sheaf codes. Using commutative algebra, we generalize the notion of canonical logical representatives from HGP codes to the sheaf code setting, resolving a longstanding challenge in explicitly characterizing sheaf codewords. Building on this foundation, we present the first comprehensive computation of cup products within the intricate framework of sheaf codes. Given Artin's primitive root conjecture which holds under the generalized Riemann hypothesis, {we establish a nearly linear family of independent cup product cochains on almost-good qLDPC codes. Under a separate nonvanishing pairing condition, they are expected to yield parallel logical multi-controlled-Z gates. Moreover, by interpreting sheaf codes as covering spaces of HGP codes, we construct interlaced families through odd-degree lifts that preserve compatible invariant pairings, allowing nontrivial, constant-depth logical gates throughout an infinite family to be certified on a constant-size HGP seed. Treating local code constructions and expansion bounds as external inputs, our framework identifies the compatibility conditions for combining large dimension and distance, local testability, and constant-depth non-Clifford gates, thereby provides a mathematical foundation for separate constructions that realize these properties simultaneously.

quant-pharXiv:2603.25831•Mar 30, 2026•10 citations

NLTS Hamiltonians from Good Quantum Codes

Anurag Anshu, Nikolas P. Breuckmann, Chinmay Nirkhe

Abstract. The no low-energy trivial state (NLTS) conjecture of Freedman and Hastings [ Quantum Inf. Comput., 14 (2014), pp. 144–180] posits that there exist families of Hamiltonians with all low energy states of nontrivial complexity (with complexity measured by the quantum circuit depth preparing the state). We prove this conjecture by showing that families of constant-rate and linear-distance qLDPC codes correspond to NLTS local Hamiltonians.

arXiv:2206.13228•SIAM Journal on Computing•Sep 4, 2026•35 citations
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)Ω(\log n)Ω(logn) 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.
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 Θ(N)\Theta(N)Θ(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 Ω(log⁡N)\Omega(\log N)Ω(logN) 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>15log⁡N−15log⁡log⁡dmax⁡−cD>\tfrac15\log N-\tfrac15\log\log d_{\max}-cD>51​logN−51​loglogdmax​−c when dmax⁡d_{\max}dmax​ 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.
The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings, 2014 -- which posits the existence of a local Hamiltonian with a super-constant quantum circuit lower bound on the complexity of all low-energy states -- identifies a fundamental obstacle to the resolution of the quantum PCP conjecture. In this work, we provide new techniques, based on entropic and local indistinguishability arguments, that prove circuit lower bounds for all the low-energy states of local Hamiltonians arising from quantum error-correcting codes. For local Hamiltonians arising from nearly linear-rate or nearly linear-distance LDPC stabilizer codes, we prove super-constant circuit lower bounds for the complexity of all states of energy o(n). Such codes are known to exist and are not necessarily locally testable, a property previously suspected to be essential for the NLTS conjecture. Curiously, such codes can also be constructed on a two-dimensional lattice, showing that low-depth states cannot accurately approximate the ground-energy even in physically relevant systems.
Non-Abelian quantum codes connect quantum error correction, phases of matter, and computational resources. In this work, we develop a general framework for constructing non-Abelian quantum low-density parity-check (qLDPC) codes by gauging sheaf codes via cup products and use it to establish code families with constant encoding rate and linear distance, simultaneously achieving optimal asymptotic scaling in both parameters. In particular, we characterize explicit logical representatives of the full gauged code space, and provide a fundamental treatment of non-Abelian code distance in the sense of Knill--Laflamme based on combining expansion with cleaning to establish protection against arbitrary errors. We further construct an almost-good family with entire code spaces exhibiting long-range magic. Moreover, we use linearly addressable cup product to directly generate linearly many encoded magic states from gauging measurements of Clifford operators. These results extend good qLDPC codes beyond the Pauli stabilizer setting, lay the foundation for pursuing the no low-energy trivial magic conjecture and shed light on non-Abelian quantum phases and orders beyond geometric locality.
The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings (Quantum Information and Computation, 2014) -- which posits the existence of a local Hamiltonian with a super-constant circuit lower bound on the complexity of all low-energy states -- identifies a fundamental obstacle to the resolution of the quantum PCP conjecture. In this paper, we provide new techniques, based on entropic and local indistinguishability arguments, for proving circuit lower bounds for the low-energy states of local Hamiltonians arising from quantum error-correcting codes. For local Hamiltonians arising from nearly linear-rate and polynomial-distance LDPC stabilizer codes, we prove a super-constant circuit lower bounds for the complexity of all states of energy o(n) (which can be viewed as an almost linear NLTS theorem). Such codes are known to exist and, in general, are not locally-testable, a property previously suspected to be essential for the NLTS conjecture. Curiously, such codes can also be constructed on a constant-dimensional lattice, showing that complex entanglement at high energies can persist in physically relevant systems.
We establish a systematic mathematical framework for constructing and computing (co)homological invariants that induce logical gates on quantum low-density parity-check (qLDPC) codes. By synthesizing tools from graph theory, algebraic topology, and number theory, we study constructions ranging from hypergraph product (HGP) codes to sheaf codes. Using commutative algebra, we generalize the notion of canonical logical representatives from HGP codes to the sheaf code setting, resolving a longstanding challenge in explicitly characterizing sheaf codewords. Building on this foundation, we present the first comprehensive computation of cup products within the intricate framework of sheaf codes. Given Artin's primitive root conjecture which holds under the generalized Riemann hypothesis, {we establish a nearly linear family of independent cup product cochains on almost-good qLDPC codes. Under a separate nonvanishing pairing condition, they are expected to yield parallel logical multi-controlled-Z gates. Moreover, by interpreting sheaf codes as covering spaces of HGP codes, we construct interlaced families through odd-degree lifts that preserve compatible invariant pairings, allowing nontrivial, constant-depth logical gates throughout an infinite family to be certified on a constant-size HGP seed. Treating local code constructions and expansion bounds as external inputs, our framework identifies the compatibility conditions for combining large dimension and distance, local testability, and constant-depth non-Clifford gates, thereby provides a mathematical foundation for separate constructions that realize these properties simultaneously.