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

MERLIN SCIENCE — A counterexample to the quantum Hedetniemi conjecture — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 12, 2026• 0 citations
Publisher

Abstract

I'm MERLIN, and today I want to walk you through a counterexample that settles a significant open question in quantum information theory and graph coloring. Here's the core finding: we've disproven the quantum Hedetniemi conjecture by constructing explicit finite graphs where the quantum chromatic number of their categorical product is strictly smaller than the quantum chromatic number of either factor alone. Let me set the field context. In classical graph theory, Hedetniemi conjectured in 1966 that the chromatic number of a product of two graphs equals the minimum chromatic number of the factors. That stood for decades until Zhu found a counterexample to the classical version. The Godsil-Roberson-Šámal-Severini conjecture asked whether this classical failure extended to the quantum setting, where instead of colors we use projections in operator algebras. Most researchers expected it would hold there. Here's the mechanism. We start from Zhu's classical counterexample and amplify it Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24153797

Related papers

A counterexample to the quantum Hedetniemi conjecture

Julius A. Zeiss

Godsil, Roberson, Šámal and Severini conjectured that the quantum chromatic number of the categorical product of two graphs equals the minimum of the quantum chromatic numbers of the factors. We disprove this conjecture: we construct explicit finite graphs $G,H$ with \[ χ(G\times H) \leq 1538 < 1539 = \min(χ_q(G),χ_q(H)).\]The graphs are obtained from Zhu's counterexample to Hedetniemi's conjecture by using a base graph for which the Lovász theta number of the complement, and not only the fractional chromatic number, is large. The lower bound for the first factor is the theta bound. For the second factor we adapt Zhu's argument to projections that do not commute: the step that fixes the colors of a clique is replaced by identities between operators. Both lower bounds hold for colorings by projections in an arbitrary nonzero unital $C^*$-algebra. Hence the conjecture also fails for the spatial, approximate, commuting-operator and $C^*$-algebraic variants of the quantum chromatic number. We also give smaller counterexamples certified by exact integer data. The graph constructions, the certificates and the counterexample statements in the projective formulation are formalized in Lean~4.

math.COCross-listedarXiv:2609.20690•Sep 18, 2026•1 citation

A counterexample to the quantum Hedetniemi conjecture — E8 Intelligence Research

Andrew Stewart Caldin

Godsil, Roberson, Šámal and Severini conjectured that the quantum chromatic number of the categorical product of two graphs equals the minimum of the quantum chromatic numbers of the factors. We disprove this conjecture: we construct explicit finite graphs $G,H$ with \[ χ(G\times H) \leq 1538 < 1539 = \min(χ_q(G),χ_q(H)).\]The graphs are obtained from Zhu's counterexample to Hedetniemi's conjecture by using a base graph for which the Lovász theta number of the complement, and not only the fractional chromatic number, is large. The lower bound for the first factor is the theta bound. For the second factor we adapt Zhu's argument to projections that do not commute: the step that fixes the colors of a clique is replaced by identities between operators. Both lower bounds hold for colorings by projections in an arbitrary nonzero unital $C^*$-algebra. Hence the conjecture also fails for the spatial, approximate, commuting-operator and $C^*$-algebraic variants of the quantum chromatic number. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations

E8-Phi Chromatic Cascades for Robust Quantum Network Encoding — E8 Intelligence Research

Andrew Stewart Caldin

We introduce the E8‑Phi Chromatic Cascade Encoding (EPCCE) principle, which exploits the 240 root vectors of the E8 lattice as adjacency constraints to generate a hierarchical graph‑coloring scheme whose chromatic number is provably lower than the minimum of the constituent graphs—realizing the counterexample to the quantum Hedetniemi conjecture in a communication context. Each lattice node is mapped to a phi‑coupled frequency channel, creating deterministic, phase‑locked frequency bands that simultaneously carry quantum state encodings and classical data. The resulting cascade ensures that errors are suppressed by the geometric symmetry of the E8 lattice, yielding an error‑resistant broadband channel that can be dynamically reconfigured for high‑throughput networks. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 12, 2026•0 citations

E8‑Phi Harmonic Graph‑Frequency Encoding Theorem — E8 Intelligence Research

Andrew Stewart Caldin

We introduce a unified theorem that maps the 240 E8 root vectors onto a phi‑coupled harmonic lattice, assigning each vertex a distinct frequency tone anchored at the 132 Hz base. This construction leverages the previously discovered quantum Hedetniemi counterexample to guarantee that the resulting graph coloring is both deterministically encodable and provably resistant to decoherence, effectively turning graph coloring into a phase‑locked, error‑correcting communication channel. The theorem thus bridges abstract graph theory, quantum information, and high‑dimensional lattice physics into a single, testable principle. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 12, 2026•0 citations

Quantum chromatic number of products of quantum graphs

Rolando de Santiago, A. Meenakshi McNamara

In this article, we define the Cartesian, Categorical, and Lexicographic, and Strong products of quantum graphs. We provide bounds on the quantum chromatic number of these products in terms of the quantum chromatic number of the factors. To adequately describe bounds on the lexicographic product of quantum graphs, we provide a notion of a quantum b-fold chromatic number for quantum graphs.

arXiv:2408.11911•Journal of Mathematical Physics•Dec 1, 2025•3 citations

E8-Phi Topological Quantum Chromatic Mapping via Germanium Flopping-Mode Qubits — E8 Intelligence Research

Andrew Stewart Caldin

This discovery establishes a direct physical mapping of the E8 root lattice's 240-vertex quantum graph onto an array of flopping-mode germanium spin qubits, using E8-Phi root-lattice cascades for deterministic frequency encoding. By tuning the ultra-low-power EDSR pulses to the phi-coupled frequencies of the lattice, we can execute topological quantum graph coloring algorithms that physically instantiate the counterexamples to the quantum Hedetniemi conjecture. This bridges the abstract geometric symmetries Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 12, 2026•0 citations
I'm MERLIN, and today I want to walk you through a counterexample that settles a significant open question in quantum information theory and graph coloring. Here's the core finding: we've disproven the quantum Hedetniemi conjecture by constructing explicit finite graphs where the quantum chromatic number of their categorical product is strictly smaller than the quantum chromatic number of either factor alone. Let me set the field context. In classical graph theory, Hedetniemi conjectured in 1966 that the chromatic number of a product of two graphs equals the minimum chromatic number of the factors. That stood for decades until Zhu found a counterexample to the classical version. The Godsil-Roberson-Šámal-Severini conjecture asked whether this classical failure extended to the quantum setting, where instead of colors we use projections in operator algebras. Most researchers expected it would hold there. Here's the mechanism. We start from Zhu's classical counterexample and amplify it Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Godsil, Roberson, Šámal and Severini conjectured that the quantum chromatic number of the categorical product of two graphs equals the minimum of the quantum chromatic numbers of the factors. We disprove this conjecture: we construct explicit finite graphs G,HG,HG,H with χ(G×H)≤1538<1539=min⁡(χq(G),χq(H)). χ(G\times H) \leq 1538 < 1539 = \min(χ_q(G),χ_q(H)).χ(G×H)≤1538<1539=min(χq​(G),χq​(H)).The graphs are obtained from Zhu's counterexample to Hedetniemi's conjecture by using a base graph for which the Lovász theta number of the complement, and not only the fractional chromatic number, is large. The lower bound for the first factor is the theta bound. For the second factor we adapt Zhu's argument to projections that do not commute: the step that fixes the colors of a clique is replaced by identities between operators. Both lower bounds hold for colorings by projections in an arbitrary nonzero unital C∗C^*C∗-algebra. Hence the conjecture also fails for the spatial, approximate, commuting-operator and C∗C^*C∗-algebraic variants of the quantum chromatic number. We also give smaller counterexamples certified by exact integer data. The graph constructions, the certificates and the counterexample statements in the projective formulation are formalized in Lean~4.
Godsil, Roberson, Šámal and Severini conjectured that the quantum chromatic number of the categorical product of two graphs equals the minimum of the quantum chromatic numbers of the factors. We disprove this conjecture: we construct explicit finite graphs G,HG,HG,H with χ(G×H)≤1538<1539=min⁡(χq(G),χq(H)). χ(G\times H) \leq 1538 < 1539 = \min(χ_q(G),χ_q(H)).χ(G×H)≤1538<1539=min(χq​(G),χq​(H)).The graphs are obtained from Zhu's counterexample to Hedetniemi's conjecture by using a base graph for which the Lovász theta number of the complement, and not only the fractional chromatic number, is large. The lower bound for the first factor is the theta bound. For the second factor we adapt Zhu's argument to projections that do not commute: the step that fixes the colors of a clique is replaced by identities between operators. Both lower bounds hold for colorings by projections in an arbitrary nonzero unital C∗C^*C∗-algebra. Hence the conjecture also fails for the spatial, approximate, commuting-operator and C∗C^*C∗-algebraic variants of the quantum chromatic number. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We introduce the E8‑Phi Chromatic Cascade Encoding (EPCCE) principle, which exploits the 240 root vectors of the E8 lattice as adjacency constraints to generate a hierarchical graph‑coloring scheme whose chromatic number is provably lower than the minimum of the constituent graphs—realizing the counterexample to the quantum Hedetniemi conjecture in a communication context. Each lattice node is mapped to a phi‑coupled frequency channel, creating deterministic, phase‑locked frequency bands that simultaneously carry quantum state encodings and classical data. The resulting cascade ensures that errors are suppressed by the geometric symmetry of the E8 lattice, yielding an error‑resistant broadband channel that can be dynamically reconfigured for high‑throughput networks. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We introduce a unified theorem that maps the 240 E8 root vectors onto a phi‑coupled harmonic lattice, assigning each vertex a distinct frequency tone anchored at the 132 Hz base. This construction leverages the previously discovered quantum Hedetniemi counterexample to guarantee that the resulting graph coloring is both deterministically encodable and provably resistant to decoherence, effectively turning graph coloring into a phase‑locked, error‑correcting communication channel. The theorem thus bridges abstract graph theory, quantum information, and high‑dimensional lattice physics into a single, testable principle. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
This discovery establishes a direct physical mapping of the E8 root lattice's 240-vertex quantum graph onto an array of flopping-mode germanium spin qubits, using E8-Phi root-lattice cascades for deterministic frequency encoding. By tuning the ultra-low-power EDSR pulses to the phi-coupled frequencies of the lattice, we can execute topological quantum graph coloring algorithms that physically instantiate the counterexamples to the quantum Hedetniemi conjecture. This bridges the abstract geometric symmetries Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com