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

Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 7, 2026• 0 citations
Publisher

Abstract

We prove RE-completeness of the quantum homomorphism problem parameterised by families of graphs derived from the classic metric association schemes. These include Kneser graphs, $q$-Kneser graphs, and the complements of Johnson, Grassmann, and Hamming graphs. Our proof develops a spectral method for establishing non-contextuality of quantum polymorphisms. It combines an equality analysis of Roberson's bound on the projective packing number in terms of Schrijver's theta with a structural argument inspired by Erdős-Ko-Rado theory. Source: http://arxiv.org/abs/2609.20678v1 (arXiv:2609.20678v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24029510

Related papers

Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism

Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert +2 more

We prove RE-completeness of the quantum homomorphism problem parameterised by families of graphs derived from the classic metric association schemes. These include Kneser graphs, $q$-Kneser graphs, and the complements of Johnson, Grassmann, and Hamming graphs. Our proof develops a spectral method for establishing non-contextuality of quantum polymorphisms. It combines an equality analysis of Roberson's bound on the projective packing number in terms of Schrijver's theta with a structural argument inspired by Erdős-Ko-Rado theory.

math.COCross-listedarXiv:2609.20678•Sep 18, 2026•0 citations

Spectral Gap Undecidability Dominates Quantum Many-Body Physics — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Undecidability of the spectral gap in quantum many-body systems (Cubitt et al.) is the dominant mathematical result; other findings are peripheral (hexaquark SU(3) multiplet, graph recoloring, spectral line precision, traffic models, leaf counting). | MATH: The spectral gap problem: given a translationally-invariant Hamiltonian \( H = \sum_i h_i \) on a 2D lattice (finite local Hilbert space), determining whether the gap \( \Delta = E_1 - E_0 \) (difference between ground state and first excited energy) is zero or positive is undecidable. This maps the halting problem onto the gap via a construction where the gap closes iff a Turing machine halts. Key constants: no specific numeric constants, but the proof uses a lattice of qudits with local dimension \( d \geq 2 \) (often \( d=2 \) suffices for the 2D case), and relies on the existence of a "gadget" Hamiltonian whose spectrum encodes the machine's computation. | CONNECTION: The undecidability proof constructs a Hamiltonian wh Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 15, 2026•0 citations

Transversal non-Clifford gates on good quantum locally testable codes — E8 Intelligence Research

Andrew Stewart Caldin

We achieve nontrivial transversal logical multi-controlled-$Z$ gates with asymptotically optimal parameters simultaneously on quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to the recent good qLTC construction of [arXiv:2609.20780]. To this end, we use the covering space method to construct a nonzero cup product pairing on a finite arithmetic cubical complex. This differs from the previous construction of almost-good codes, whose base space is a hypergraph product. We express the pairing as a coefficient in a product of Moore determinants and prove polynomial nonvanishing by a bipartite multigraph specialization. We then construct covering spaces to obtain an asymptotic family of good qLTCs on which the pulled-back pairing induces the desired nontrivial transversal logical action. Source: http://arxiv.org/abs/2609.26691v1 (arXiv:2609.26691v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 10, 2026•0 citations

E8‑Phi Quantum‑Colorable Cascade (QCC) Protocol — E8 Intelligence Research

Andrew Stewart Caldin

The QCC Protocol leverages the 240‑dimensional E8 root lattice to generate a family of mutually non‑conflicting quantum colorings whose existence follows from the quantum Hedetniemi conjecture counterexample. By mapping each lattice node to a 132 Hz base frequency and scaling adjacency through the golden ratio φ, the protocol creates deterministic frequency cascades that can be phase‑locked across multiple channels, yielding an intrinsically error‑resistant quantum communication scheme. This unified geometric framework unifies graph‑coloring theory, frequency encoding, and lattice‑based phase‑locking into a single, analytically tractable architecture. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 12, 2026•0 citations

Undecidability of the Spectral Gap Problem via Halting Problem Encoding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Undecidability in the spectral gap problem for quantum many-body systems proves that determining whether a system is gapped or gapless is algorithmically impossible in general. | MATH: The spectral gap problem is mapped to the halting problem via translationally invariant Hamiltonians on a 2D lattice; the set of gapped Hamiltonians is Π₂-complete in the arithmetic hierarchy. Key constants: no specific numerical constants emerge, but the proof relies on encoding Turing machine states into local Hamiltonian terms. | CONNECTION: No direct geometric harmony ratios (0.382, 0.618, etc.) appear. However, the lattice structure (2D square lattice) and translational invariance connect to crystallographic symmetry groups (p4m wallpaper group). The undecidability result implies that spectral gaps—which determine whether a system is an insulator (gapped) or conductor (gapless)—cannot be universally predicted, breaking the dream of a complete mathematical description of matter. | DEPTH: 9/1 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 20, 2026•0 citations

Quantum Entanglement Collapses Quantum Verification Hierarchy to Recursively Enumerable Class — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: MIP*=RE proves quantum entanglement can verify undecidable problems, collapsing the quantum verification hierarchy into the classical recursively enumerable class. | MATH: MIP* = RE (where MIP* = multiprover interactive proofs with quantum entanglement, RE = recursively enumerable languages). The Halting Problem is in RE but not in R (decidable). This implies that the set of problems verifiable by entangled quantum provers is exactly the set of problems computable by a Turing machine that may not halt on non-members. | CONNECTION: No direct geometric ratios or constants (0.382, 0.618, etc.) appear. However, the result relies on the structure of the *commuting operator* model of quantum correlations, which is deeply tied to *operator algebras* and *C*-algebras — these have known connections to root systems and Lie algebras (e.g., the Weyl algebra, SU(2) representations). The proof uses a *self-testing* protocol based on the *linear constraint system* (LCS) games, which are buil Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 2, 2026•0 citations
We prove RE-completeness of the quantum homomorphism problem parameterised by families of graphs derived from the classic metric association schemes. These include Kneser graphs, qqq-Kneser graphs, and the complements of Johnson, Grassmann, and Hamming graphs. Our proof develops a spectral method for establishing non-contextuality of quantum polymorphisms. It combines an equality analysis of Roberson's bound on the projective packing number in terms of Schrijver's theta with a structural argument inspired by Erdős-Ko-Rado theory. Source: http://arxiv.org/abs/2609.20678v1 (arXiv:2609.20678v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We prove RE-completeness of the quantum homomorphism problem parameterised by families of graphs derived from the classic metric association schemes. These include Kneser graphs, qqq-Kneser graphs, and the complements of Johnson, Grassmann, and Hamming graphs. Our proof develops a spectral method for establishing non-contextuality of quantum polymorphisms. It combines an equality analysis of Roberson's bound on the projective packing number in terms of Schrijver's theta with a structural argument inspired by Erdős-Ko-Rado theory.
FINDING: Undecidability of the spectral gap in quantum many-body systems (Cubitt et al.) is the dominant mathematical result; other findings are peripheral (hexaquark SU(3) multiplet, graph recoloring, spectral line precision, traffic models, leaf counting). | MATH: The spectral gap problem: given a translationally-invariant Hamiltonian H=∑ihi H = \sum_i h_i H=∑i​hi​ on a 2D lattice (finite local Hilbert space), determining whether the gap Δ=E1−E0 \Delta = E_1 - E_0 Δ=E1​−E0​ (difference between ground state and first excited energy) is zero or positive is undecidable. This maps the halting problem onto the gap via a construction where the gap closes iff a Turing machine halts. Key constants: no specific numeric constants, but the proof uses a lattice of qudits with local dimension d≥2 d \geq 2 d≥2 (often d=2 d=2 d=2 suffices for the 2D case), and relies on the existence of a "gadget" Hamiltonian whose spectrum encodes the machine's computation. | CONNECTION: The undecidability proof constructs a Hamiltonian wh Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We achieve nontrivial transversal logical multi-controlled-ZZZ gates with asymptotically optimal parameters simultaneously on quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to the recent good qLTC construction of [arXiv:2609.20780]. To this end, we use the covering space method to construct a nonzero cup product pairing on a finite arithmetic cubical complex. This differs from the previous construction of almost-good codes, whose base space is a hypergraph product. We express the pairing as a coefficient in a product of Moore determinants and prove polynomial nonvanishing by a bipartite multigraph specialization. We then construct covering spaces to obtain an asymptotic family of good qLTCs on which the pulled-back pairing induces the desired nontrivial transversal logical action. Source: http://arxiv.org/abs/2609.26691v1 (arXiv:2609.26691v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
The QCC Protocol leverages the 240‑dimensional E8 root lattice to generate a family of mutually non‑conflicting quantum colorings whose existence follows from the quantum Hedetniemi conjecture counterexample. By mapping each lattice node to a 132 Hz base frequency and scaling adjacency through the golden ratio φ, the protocol creates deterministic frequency cascades that can be phase‑locked across multiple channels, yielding an intrinsically error‑resistant quantum communication scheme. This unified geometric framework unifies graph‑coloring theory, frequency encoding, and lattice‑based phase‑locking into a single, analytically tractable architecture. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Undecidability in the spectral gap problem for quantum many-body systems proves that determining whether a system is gapped or gapless is algorithmically impossible in general. | MATH: The spectral gap problem is mapped to the halting problem via translationally invariant Hamiltonians on a 2D lattice; the set of gapped Hamiltonians is Π₂-complete in the arithmetic hierarchy. Key constants: no specific numerical constants emerge, but the proof relies on encoding Turing machine states into local Hamiltonian terms. | CONNECTION: No direct geometric harmony ratios (0.382, 0.618, etc.) appear. However, the lattice structure (2D square lattice) and translational invariance connect to crystallographic symmetry groups (p4m wallpaper group). The undecidability result implies that spectral gaps—which determine whether a system is an insulator (gapped) or conductor (gapless)—cannot be universally predicted, breaking the dream of a complete mathematical description of matter. | DEPTH: 9/1 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: MIP*=RE proves quantum entanglement can verify undecidable problems, collapsing the quantum verification hierarchy into the classical recursively enumerable class. | MATH: MIP* = RE (where MIP* = multiprover interactive proofs with quantum entanglement, RE = recursively enumerable languages). The Halting Problem is in RE but not in R (decidable). This implies that the set of problems verifiable by entangled quantum provers is exactly the set of problems computable by a Turing machine that may not halt on non-members. | CONNECTION: No direct geometric ratios or constants (0.382, 0.618, etc.) appear. However, the result relies on the structure of the *commuting operator* model of quantum correlations, which is deeply tied to *operator algebras* and *C*-algebras — these have known connections to root systems and Lie algebras (e.g., the Weyl algebra, SU(2) representations). The proof uses a *self-testing* protocol based on the *linear constraint system* (LCS) games, which are buil Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com