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

Quantum Error Correction as Parallel Transport on the Grassmannian

Ian Richard C Buckley

Published Jul 9, 2026• 0 citations
Publisher

Abstract

Shows that stabiliser QEC has a natural geometric home on the Grassmannian Gr(2^k,2^n). Code subspace = point, distance = geodesic, syndrome = boundary map, logical gates = loops, threshold = beta* snap. Eastin-Knill theorem derived as pi_2(Gr)=Z obstruction requiring BIND.
DOI
10.5281/zenodo.21284199

Related papers

Quantum Error Correction: From Stabilizer Formalism to 10,000× Error Reduction — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum error correction (QEC) has crossed the threshold from theoretical construct to demonstrable engineering, with Google's surface-code milestone and Riverlane's "Deltaflow" stack targeting a 10,000× error reduction — but the mathematical core remains the stabilizer formalism and topological lattice codes. | MATH: Stabilizer codes: error syndromes from Pauli group \( \mathcal{P}_n \) via generators \( S_i \) with \( S_i^2 = I \), \( [S_i,S_j]=0 \). Logical qubit encoded in \( 2^k \)-dimensional code space defined by \( S_i|\psi\rangle = |\psi\rangle \). Surface code: distance-\(d\) lattice, threshold ~1% per gate, logical error rate \( \epsilon_L \propto (\epsilon/\epsilon_{th})^{(d+1)/2} \). Riverlane's 10,000× reduction implies \( \epsilon_L \) scaling from \( 10^{-3} \) to \( 10^{-7} \) — a factor of \( 10^4 = (10^2)^2 \), consistent with doubling code distance \( d \to 2d \) in the sub-threshold regime. | CONNECTION: Surface codes are **planar graphs on square lattices Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 30, 2026•0 citations

Quantum Error Correction as Cohomological Encoding

Ian Richard C Buckley

Quantum error correction (QEC) is cohomological encoding made explicit. We show that the three central codes in fault-tolerant quantum computation correspond precisely to three levels of the H^k tower of the Origami instruction-set architecture (ISA): the Steane [[7,1,3]] code is the Fano plane PG(2,2) at the H^1 tier; the surface code encodes logical qubits as generators of H^1(surface;Z_2); and the 15-to-1 magic state distillation factory is an H^1 Clifford circuit that bridges H^1 and~H^2 by purifying the non-Clifford TWIST\ resource. A fourth result is new: dark-magic errors are syndrome-invisible. A unitary with TWIST>0 that commutes with all stabiliser generators corrupts the logical orbit label while leaving every syndrome bit at +1. Standard randomised benchmarking is insensitive to orbit-label decay; we propose orbit-sensitive randomised benchmarking (ORBIT-RB) as the missing diagnostic. The unified picture is captured in a single sentence: a QEC code of depth k specifies which H^k classes are logical and which are trivial; syndrome measurement computes the coboundary ; error correction finds the minimum-weight representative of the observed H^k class.

•Jul 13, 2026•0 citations

Error Correction of Quantum Reference Frame Information

Patrick M. Hayden, Sepehr Nezami, Sandu Popescu +1 more

An investigation of group covariant quantum error correction indicates that the Eastin-Knill theorem, a stumbling block on the path to fault-tolerant quantum computation, may be circumvented by using continuous variables.

arXiv:1709.04471•PRX Quantum•Feb 18, 2021•59 citations

The Arithmetic Geometry of Quantum Error Correction

QNFO Research Collective, Rowan Brad Quni-Gudzinas

Bridges Kodaira-Neron classification to Shor QEC code via p-adic Hodge theory.

•Jul 4, 2026•0 citations

Non-Associative Quantum Error Correction (NA-QEC): The Exceptional Jordan-KL Condition and Rank-1 Idempotents in $G_2$ Topologies

Ian Richard C Buckley

CORRECTION NOTICE (2026-08). No error-correction simulation was performed for this work; the Knill–Laflamme conditions are asserted rather than verified. Treat the construction as a proposal. A revised version is in preparation. Standard quantum error correction (QEC) is founded on the Knill-Laflamme (KL) conditions, which implicitly assume that physical error operators compose associatively. Over the non-associative Octonions $\mathbb{O}$ and the exceptional Lie group $G_2$, this assumption fails: the elementary identity $(PE_a^\dagger)(E_b P) = P(E_a^\dagger E_b)P$ no longer holds, generating a chiral shear that breaks the Hermitian reality of observable eigenvalues. We resolve this obstruction by replacing ordinary matrix multiplication with the Jordan product $A\circ B = \frac{1}{2}(AB+BA)$, which restores Hermiticity by symmetrisation while retaining non-associativity. Working over the 27-dimensional Exceptional Jordan Algebra $\mathfrak{J}_3(\mathbb{O})$ (the Albert algebra), we prove the Exceptional Jordan-KL Condition: for the Furey projector $P = \mathrm{diag}(1,0,0) \in \mathfrak{J}_3(\mathbb{O})$, the Jordan U-operator satisfies $$\{P, E_a^\dagger \circ E_b, P\} = c_{ab} P$$ for every symmetrised error element $E_a^\dagger \circ E_b \in \mathfrak{J}_3(\mathbb{O})$, where $c_{ab} \in \mathbb{R}$ is a scalar determined by the normalised trace. The proof rests entirely on the standard Peirce decomposition of $\mathfrak{J}_3(\mathbb{O})$ and McCrimmon's classification of primitive idempotents; no novel algebraic machinery is required. We apply this result to the 731-QPU: the Steane $[[7,1,3]]$ code operates as the hardware-native QEC layer, and the Fano-plane incidence structure enforces distance $d=3$ geometrically via the Associator Penalty. NA-QEC monitors Jordan-algebraic coherence continuously rather than measuring discrete Pauli parities, trading measurement-induced decoherence for a geometric error-detection channel. We carefully delineate what is proved from what is conjectured: the claim that NA-QEC evades the Eastin-Knill theorem is stated as an open conjecture, motivated by the observation that the Eastin-Knill proof requires the logical subspace to carry a continuous Lie-group representation, a condition that is absent when the logical space is the 1-dimensional Peirce-1 subspace of $\mathfrak{J}_3(\mathbb{O})$.

•May 8, 2026•0 citations

Quantum Error Correction: From Stabilizer Codes to Fault-Tolerance Frontiers — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum error correction (QEC) is advancing from theoretical stabilizer codes to practical fault-tolerance thresholds, with continuous-time formulations emerging as a key frontier. MATH: - **Stabilizer formalism**: Pauli group \( \mathcal{P}_n \) on \( n \) qubits; code space \( \mathcal{C} = \{|\psi\rangle : S_i|\psi\rangle = |\psi\rangle \ \forall i\} \), with \( S_i \) generators of an abelian subgroup of \( \mathcal{P}_n \). - **Distance & threshold**: A \([[n,k,d]]\) code corrects \( t = \lfloor (d-1)/2 \rfloor \) errors; fault-tolerance threshold \( p_{\text{th}} \approx 10^{-3} \)–\(10^{-2} \) per gate (surface code). - **Continuous-time QEC (CTQEC)**: Master equation \( \dot{\rho} = -i[H,\rho] + \sum_k \gamma_k \mathcal{D}[L_k]\rho \), with weak measurements and feedback; error rate scales as \( \gamma_k \propto (\text{measurement strength})^2 / \text{noise bandwidth} \). - **QuOps metric**: Reliable quantum operations \( \sim 10^3 \)–\(10^4 \) currently; tar Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 23, 2026•0 citations
FINDING: Quantum error correction (QEC) has crossed the threshold from theoretical construct to demonstrable engineering, with Google's surface-code milestone and Riverlane's "Deltaflow" stack targeting a 10,000× error reduction — but the mathematical core remains the stabilizer formalism and topological lattice codes. | MATH: Stabilizer codes: error syndromes from Pauli group Pn \mathcal{P}_n Pn​ via generators Si S_i Si​ with Si2=I S_i^2 = I Si2​=I, [Si,Sj]=0 [S_i,S_j]=0 [Si​,Sj​]=0. Logical qubit encoded in 2k 2^k 2k-dimensional code space defined by Si∣ψ⟩=∣ψ⟩ S_i|\psi\rangle = |\psi\rangle Si​∣ψ⟩=∣ψ⟩. Surface code: distance-ddd lattice, threshold ~1% per gate, logical error rate ϵL∝(ϵ/ϵth)(d+1)/2 \epsilon_L \propto (\epsilon/\epsilon_{th})^{(d+1)/2} ϵL​∝(ϵ/ϵth​)(d+1)/2. Riverlane's 10,000× reduction implies ϵL \epsilon_L ϵL​ scaling from 10−3 10^{-3} 10−3 to 10−7 10^{-7} 10−7 — a factor of 104=(102)2 10^4 = (10^2)^2 104=(102)2, consistent with doubling code distance d→2d d \to 2d d→2d in the sub-threshold regime. | CONNECTION: Surface codes are **planar graphs on square lattices Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Quantum error correction (QEC) is cohomological encoding made explicit. We show that the three central codes in fault-tolerant quantum computation correspond precisely to three levels of the H^k tower of the Origami instruction-set architecture (ISA): the Steane [[7,1,3]] code is the Fano plane PG(2,2) at the H^1 tier; the surface code encodes logical qubits as generators of H^1(surface;Z_2); and the 15-to-1 magic state distillation factory is an H^1 Clifford circuit that bridges H^1 and~H^2 by purifying the non-Clifford TWIST\ resource. A fourth result is new: dark-magic errors are syndrome-invisible. A unitary with TWIST>0 that commutes with all stabiliser generators corrupts the logical orbit label while leaving every syndrome bit at +1. Standard randomised benchmarking is insensitive to orbit-label decay; we propose orbit-sensitive randomised benchmarking (ORBIT-RB) as the missing diagnostic. The unified picture is captured in a single sentence: a QEC code of depth k specifies which H^k classes are logical and which are trivial; syndrome measurement computes the coboundary ; error correction finds the minimum-weight representative of the observed H^k class.
Non-Associative Quantum Error Correction (NA-QEC): The Exceptional Jordan-KL Condition and Rank-1 Idempotents in G2G_2G2​ Topologies
CORRECTION NOTICE (2026-08). No error-correction simulation was performed for this work; the Knill–Laflamme conditions are asserted rather than verified. Treat the construction as a proposal. A revised version is in preparation. Standard quantum error correction (QEC) is founded on the Knill-Laflamme (KL) conditions, which implicitly assume that physical error operators compose associatively. Over the non-associative Octonions O\mathbb{O}O and the exceptional Lie group G2G_2G2​, this assumption fails: the elementary identity (PEa†)(EbP)=P(Ea†Eb)P(PE_a^\dagger)(E_b P) = P(E_a^\dagger E_b)P(PEa†​)(Eb​P)=P(Ea†​Eb​)P no longer holds, generating a chiral shear that breaks the Hermitian reality of observable eigenvalues. We resolve this obstruction by replacing ordinary matrix multiplication with the Jordan product A∘B=12(AB+BA)A\circ B = \frac{1}{2}(AB+BA)A∘B=21​(AB+BA), which restores Hermiticity by symmetrisation while retaining non-associativity. Working over the 27-dimensional Exceptional Jordan Algebra J3(O)\mathfrak{J}_3(\mathbb{O})J3​(O) (the Albert algebra), we prove the Exceptional Jordan-KL Condition: for the Furey projector P=diag(1,0,0)∈J3(O)P = \mathrm{diag}(1,0,0) \in \mathfrak{J}_3(\mathbb{O})P=diag(1,0,0)∈J3​(O), the Jordan U-operator satisfies {P,Ea†∘Eb,P}=cabP\{P, E_a^\dagger \circ E_b, P\} = c_{ab} P{P,Ea†​∘Eb​,P}=cab​P for every symmetrised error element Ea†∘Eb∈J3(O)E_a^\dagger \circ E_b \in \mathfrak{J}_3(\mathbb{O})Ea†​∘Eb​∈J3​(O), where cab∈Rc_{ab} \in \mathbb{R}cab​∈R is a scalar determined by the normalised trace. The proof rests entirely on the standard Peirce decomposition of J3(O)\mathfrak{J}_3(\mathbb{O})J3​(O) and McCrimmon's classification of primitive idempotents; no novel algebraic machinery is required. We apply this result to the 731-QPU: the Steane [[7,1,3]][[7,1,3]][[7,1,3]] code operates as the hardware-native QEC layer, and the Fano-plane incidence structure enforces distance d=3d=3d=3 geometrically via the Associator Penalty. NA-QEC monitors Jordan-algebraic coherence continuously rather than measuring discrete Pauli parities, trading measurement-induced decoherence for a geometric error-detection channel. We carefully delineate what is proved from what is conjectured: the claim that NA-QEC evades the Eastin-Knill theorem is stated as an open conjecture, motivated by the observation that the Eastin-Knill proof requires the logical subspace to carry a continuous Lie-group representation, a condition that is absent when the logical space is the 1-dimensional Peirce-1 subspace of J3(O)\mathfrak{J}_3(\mathbb{O})J3​(O).
FINDING: Quantum error correction (QEC) is advancing from theoretical stabilizer codes to practical fault-tolerance thresholds, with continuous-time formulations emerging as a key frontier. MATH: - **Stabilizer formalism**: Pauli group Pn \mathcal{P}_n Pn​ on n n n qubits; code space C={∣ψ⟩:Si∣ψ⟩=∣ψ⟩ ∀i} \mathcal{C} = \{|\psi\rangle : S_i|\psi\rangle = |\psi\rangle \ \forall i\} C={∣ψ⟩:Si​∣ψ⟩=∣ψ⟩ ∀i}, with Si S_i Si​ generators of an abelian subgroup of Pn \mathcal{P}_n Pn​. - **Distance & threshold**: A [[n,k,d]][[n,k,d]][[n,k,d]] code corrects t=⌊(d−1)/2⌋ t = \lfloor (d-1)/2 \rfloor t=⌊(d−1)/2⌋ errors; fault-tolerance threshold pth≈10−3 p_{\text{th}} \approx 10^{-3} pth​≈10−3–10−210^{-2} 10−2 per gate (surface code). - **Continuous-time QEC (CTQEC)**: Master equation ρ˙=−i[H,ρ]+∑kγkD[Lk]ρ \dot{\rho} = -i[H,\rho] + \sum_k \gamma_k \mathcal{D}[L_k]\rho ρ˙​=−i[H,ρ]+∑k​γk​D[Lk​]ρ, with weak measurements and feedback; error rate scales as γk∝(measurement strength)2/noise bandwidth \gamma_k \propto (\text{measurement strength})^2 / \text{noise bandwidth} γk​∝(measurement strength)2/noise bandwidth. - **QuOps metric**: Reliable quantum operations ∼103 \sim 10^3 ∼103–10410^4 104 currently; tar Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com