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

The Undecidability of the Spectral Gap: An Expository Account of a Fundamental Limitation in Quantum Many-Body Physics

Doug Doucette

Published Aug 6, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.20273.13927

Related papers

Undecidability of the spectral gap

Johannes Bausch

What happens to undecidability in the quantum computing paradigm?

XRDS Crossroads The ACM Magazine for Students•Sep 20, 2016•51 citations

Undecidability of the Spectral Gap: An Epistemological Look

Emiliano Ippoliti, S. Caprara

Journal for General Philosophy of Science•Mar 1, 2021•5 citations

Undecidability of the spectral gap

Toby S. Cubitt, David Pérez-García, Michael M. Wolf

arXiv:1502.04135•Nature•Dec 1, 2015•281 citations

The Spectral Foundations of Quantum Many-Body Dynamics

Stergios Pellis

•Oct 25, 2026•0 citations

The Undecidability of the Spectral Gap: An Expository Account of a Fundamental Limitation in Quantum Many-Body Physics

Doug Doucette

This paper provides a self-contained conceptual overview of one of the most striking results in contemporary quantum many-body physics: the undecidability of the spectral gap problem. The spectral gap—the energy difference between a system's ground state and its first excited state—is a fundamental property that distinguishes insulating from conducting behavior and marks quantum phase transitions. In 2015, Cubitt, Pérez-García, and Wolf proved that deciding whether a translationally invariant quantum spin system with finite-range interactions is gapped or gapless is algorithmically undecidable. This result was extended to one-dimensional systems by Bausch and colleagues in 2020, overturning the intuition that lower-dimensional systems are inherently more tractable. The proof architecture rests on two main ingredients: aperiodic tilings and history-state constructions. Aperiodic tilings encode undecidable combinatorial properties into the spatial structure of the Hamiltonian, while history states embed the evolution of a Turing machine into the ground state. By combining these elements, the authors construct explicit Hamiltonians whose spectral gap depends directly on whether a simulated Turing machine halts—a problem known to be undecidable. Thus, no algorithm can classify every instance correctly. The paper also distinguishes two forms of undecidability: algorithmic undecidability, which asserts that no Turing machine can solve the problem for all instances, and axiomatic independence, which shows that for some Hamiltonians, the gap status is not determined by the standard axioms of mathematics. These results impose fundamental limits on numerical simulation and phase classification, but they do not render all systems intractable. They demarcate a boundary between decidable and undecidable behavior, revealing deep connections between physics, computation, and logic.

•Aug 6, 2026•0 citations

Undecidability of the Quantum Spectral Gap Limits Material Property Prediction — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Undecidability in quantum spectral gaps proves that the existence of a spectral gap in many-body systems is not algorithmically decidable, implying fundamental limits to predicting material properties. | MATH: The spectral gap problem reduces to the halting problem; no algorithm can determine if a Hamiltonian's ground state energy is separated from the excited states by a finite gap. Key constants: spectral gap Δ = E₁ - E₀, where Δ > 0 indicates an insulator, Δ = 0 a conductor. | CONNECTION: The undecidability result is tied to the structure of Projected Entangled Pair States (PEPS), which encode lattice symmetries and tensor network geometries. The spectral gap's undecidability mirrors the non-computability of certain geometric invariants in crystallographic root systems (e.g., Coxeter groups). | DEPTH: 9 — This is a profound link between computation theory and quantum many-body physics, showing that geometric order (e.g., lattice gaps) can be algorithmically inaccessible, ec Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 31, 2026•0 citations
This paper provides a self-contained conceptual overview of one of the most striking results in contemporary quantum many-body physics: the undecidability of the spectral gap problem. The spectral gap—the energy difference between a system's ground state and its first excited state—is a fundamental property that distinguishes insulating from conducting behavior and marks quantum phase transitions. In 2015, Cubitt, Pérez-García, and Wolf proved that deciding whether a translationally invariant quantum spin system with finite-range interactions is gapped or gapless is algorithmically undecidable. This result was extended to one-dimensional systems by Bausch and colleagues in 2020, overturning the intuition that lower-dimensional systems are inherently more tractable. The proof architecture rests on two main ingredients: aperiodic tilings and history-state constructions. Aperiodic tilings encode undecidable combinatorial properties into the spatial structure of the Hamiltonian, while history states embed the evolution of a Turing machine into the ground state. By combining these elements, the authors construct explicit Hamiltonians whose spectral gap depends directly on whether a simulated Turing machine halts—a problem known to be undecidable. Thus, no algorithm can classify every instance correctly. The paper also distinguishes two forms of undecidability: algorithmic undecidability, which asserts that no Turing machine can solve the problem for all instances, and axiomatic independence, which shows that for some Hamiltonians, the gap status is not determined by the standard axioms of mathematics. These results impose fundamental limits on numerical simulation and phase classification, but they do not render all systems intractable. They demarcate a boundary between decidable and undecidable behavior, revealing deep connections between physics, computation, and logic.
FINDING: Undecidability in quantum spectral gaps proves that the existence of a spectral gap in many-body systems is not algorithmically decidable, implying fundamental limits to predicting material properties. | MATH: The spectral gap problem reduces to the halting problem; no algorithm can determine if a Hamiltonian's ground state energy is separated from the excited states by a finite gap. Key constants: spectral gap Δ = E₁ - E₀, where Δ > 0 indicates an insulator, Δ = 0 a conductor. | CONNECTION: The undecidability result is tied to the structure of Projected Entangled Pair States (PEPS), which encode lattice symmetries and tensor network geometries. The spectral gap's undecidability mirrors the non-computability of certain geometric invariants in crystallographic root systems (e.g., Coxeter groups). | DEPTH: 9 — This is a profound link between computation theory and quantum many-body physics, showing that geometric order (e.g., lattice gaps) can be algorithmically inaccessible, ec Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com