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

Surface Codes as B2 Root Systems with Percolation-Like Error Thresholds — E8 Intelligence Research

Andrew Stewart Caldin

Published Aug 24, 2026• 0 citations
Publisher

Abstract

FINDING: Surface codes implement topological quantum error correction via a square lattice whose stabilizer structure maps directly onto the B2 root system, with error thresholds tied to percolation-like critical ratios. MATH: - Surface code: qubits on edges of a square lattice; stabilizers = vertex operators \(A_v = \prod_{e \ni v} X_e\) and plaquette operators \(B_p = \prod_{e \in \partial p} Z_e\), with \(A_v^2 = B_p^2 = I\), \([A_v, B_p] = 0\). - Logical operators: non-contractible loops — \(X\)-type along a horizontal cycle, \(Z\)-type along a vertical cycle; logical Pauli algebra \(\bar{X}, \bar{Z}\) with \(\bar{X}\bar{Z} = -\bar{Z}\bar{X}\). - Distance \(d\) = minimum weight of logical operator = lattice dimension \(L\) (for \(L \times L\) patch); code rate \(k/n = 1/(2L^2 - 2L + 1)\). - Error threshold: \(p_{\text{th}} \approx 0.103\) (for depolarizing noise) — a critical probability, not a simple ratio but related to percolation threshold on square lattice \(p_c \app Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.22075612

Related papers

Surface Code Error Correction via Stabilizer Formalism and Lattice Geometry — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface code error correction uses stabilizer formalism with parity check matrices derived from lattice geometry, enabling fault-tolerant quantum computation. MATH: - Stabilizer group \( S = \langle g_1, g_2, \dots, g_m \rangle \) where each \( g_i \) is a Pauli operator (tensor product of \( X, Y, Z, I \)) on \( n \) qubits. - Parity check matrix \( H \) over \( \mathbb{F}_2 \) (for \( X \) and \( Z \) errors separately) has size \( (n-k) \times n \), with rows corresponding to stabilizer generators. - Surface code: qubits on edges of a square lattice, stabilizers are plaquette (Z-type) and vertex (X-type) operators. Code distance \( d \) scales with lattice size \( L \): \( d = L \) for \( L \times L \) lattice. - Logical operators are non-trivial cycles on the dual lattice, with commutation relations given by intersection number mod 2. - Error correction threshold: \( p_{\text{th}} \approx 0.103 \) (for standard depolarizing noise) — no simple rational ratio, but Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 28, 2026•0 citations

Topological Quantum Error Correction via Toric Codes and Anyon Braiding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Topological quantum error correction (TQEC) uses lattice geometry—specifically the toric code and surface codes—to encode logical qubits non-locally, with error thresholds tied to lattice percolation and anyon braiding. MATH: - Toric code: Hamiltonian \( H = -\sum_v A_v - \sum_p B_p \), with star operators \( A_v = \prod_{i \in v} X_i \) and plaquette operators \( B_p = \prod_{i \in p} Z_i \). Ground state degeneracy on genus-\(g\) surface: \( 4^g \). - Logical operators: non-contractible loops on torus — \( \bar{X}, \bar{Z} \) each have weight \( L \) (lattice length), minimum weight scales as \( O(L) \) for \( L \times L \) lattice. - Error threshold: surface code ~1.1% (per-qubit depolarizing), toric code ~10.1% (bit-flip only) — related to percolation threshold on square lattice \( p_c \approx 0.593 \) (site) and \( p_c \approx 0.5 \) (bond). - Anyon statistics: \( e \) (charge) and \( m \) (flux) excitations obey \( \mathbb{Z}_2 \) fusion: \( e \times m = \psi \) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 24, 2026•0 citations

Topological Error Suppression: Exponential Scaling in Surface Code Quantum Correction — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface code logical error rate scales exponentially with code distance (lattice size), enabling practical quantum error correction via topological order. | MATH: Logical error rate \(P_L \propto (\Lambda)^{-d}\), where \(d\) = code distance (linear lattice dimension), \(\Lambda = P_{th}/P_{phys}\) (error suppression factor per round). Threshold \(P_{th} \approx 0.01\) (1% per qubit per cycle). Physical-to-logical overhead scales as \(O(d^2)\) qubits per logical qubit. | CONNECTION: The surface code is a **Z₂ toric code** — a lattice gauge theory on a square lattice with **crystallographic symmetry (p4m plane group)**. The logical operators are **non-contractible loops** on the torus (genus-1 surface), whose weight scales as \(d\) — directly tied to the **topological winding number** and the **fundamental group \(\pi_1(T^2) = \mathbb{Z} \times \mathbb{Z}\)**. The threshold ~1% is not a golden ratio, but the **error suppression per distance** \(\Lambda\) often approaches values Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 2, 2026•0 citations

Percolation Thresholds Unify Quantum Error Correction and Phase Transitions — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface-code error correction thresholds align with percolation-theoretic critical probabilities in 2D lattices, establishing a deep equivalence between quantum error correction and classical statistical-mechanics phase transitions. | MATH: The surface code threshold is governed by the bond-percolation threshold \( p_c \) on the square lattice, \( p_c = 1/2 \). For the Fibonacci Turaev–Viro code (non-Abelian anyons), thresholds map to golden-ratio-related critical exponents. The Kitaev toric code threshold satisfies \( p_{\text{th}} = p_c(\text{square}) = 0.5 \) for perfect syndrome measurement; with faulty measurements, the threshold drops to \( p_{\text{th}} \approx 0.109 \) (matching the 2D random-bond Ising model multicritical point). LDPC codes (Delfosse) exhibit thresholds tied to the percolation transition on expander graphs, where the critical density satisfies \( p_c \sim 1/d \) for degree-\( d \) graphs. | CONNECTION: The square-lattice percolation threshold \( p_c = Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 23, 2026•0 citations

Surface Code Threshold as Percolation Phase Transition on Torus Homology — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface code logical operators are homology cycles on a torus lattice; error correction threshold is a phase transition point determined by percolation of string-like excitations. MATH: - Logical operators: \( \hat{X}_L = \prod_{i \in \text{cycle}} X_i \), \( \hat{Z}_L = \prod_{j \in \text{cocycle}} Z_j \); homology group \( H_1(\mathbb{T}^2, \mathbb{Z}_2) \cong \mathbb{Z}_2^2 \). - Threshold: \( p_{\text{th}} \approx 0.103 \) (for standard surface code under independent bit-flip/phase-flip noise); satisfies \( p_{\text{th}} = \frac{1}{2} \left(1 - \frac{1}{\sqrt{2}}\right) \approx 0.146 \) for certain noise models (e.g., depolarizing). - Error correction condition: \( \text{Pr}(\text{logical error}) \sim e^{-\alpha L} \) for \( p < p_{\text{th}} \), with \( L \) lattice size; scaling exponent \( \alpha \) related to critical exponents of 2D random-bond Ising model. CONNECTION: - Homology cycles map to closed strings on a torus; threshold \( p_{\text{th}} \approx 0 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 28, 2026•0 citations

Exponential Error Suppression in Surface Codes: Scaling with Code Distance — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface code logical qubit error suppression scales with code distance \(d\), with logical error rate \(P_L \propto (\Lambda)^{-(d+1)/2}\) where \(\Lambda\) is the error-limit parameter; Google's 2022 experiment demonstrated exponential suppression across \(d=3,5,7\). MATH: - Logical error rate: \(P_L \propto \Lambda^{-(d+1)/2}\) (exponential in code distance) - Threshold condition: physical error rate \(p < p_{th} \approx 0.01\) (for standard surface code with depolarizing noise) - Stabilizer weight: \(w = 4\) (X and Z plaquette operators on square lattice) - Logical operator weight: \(w_L = d\) (minimum weight path across lattice) - Lattice: square grid, \(d \times d\) qubit array, \(d^2\) data qubits + \((d^2-1)\) ancilla qubits - Key ratio: \(P_L / P_{phys} \sim (\Lambda)^{-(d+1)/2}\) where \(\Lambda \approx p_{th}/p\) CONNECTION: - Square lattice = \(Z^2\) root system (crystallographic, order 4 symmetry) — stabilizer generators are 4-body plaquette opera Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 1, 2026•0 citations
FINDING: Surface codes implement topological quantum error correction via a square lattice whose stabilizer structure maps directly onto the B2 root system, with error thresholds tied to percolation-like critical ratios. MATH: - Surface code: qubits on edges of a square lattice; stabilizers = vertex operators (A_v = \prod_{e \ni v} X_e) and plaquette operators (B_p = \prod_{e \in \partial p} Z_e), with (A_v^2 = B_p^2 = I), ([A_v, B_p] = 0). - Logical operators: non-contractible loops — (X)-type along a horizontal cycle, (Z)-type along a vertical cycle; logical Pauli algebra (\bar{X}, \bar{Z}) with (\bar{X}\bar{Z} = -\bar{Z}\bar{X}). - Distance (d) = minimum weight of logical operator = lattice dimension (L) (for (L \times L) patch); code rate (k/n = 1/(2L^2 - 2L + 1)). - Error threshold: (p_{\text{th}} \approx 0.103) (for depolarizing noise) — a critical probability, not a simple ratio but related to percolation threshold on square lattice (p_c \app Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Surface code error correction uses stabilizer formalism with parity check matrices derived from lattice geometry, enabling fault-tolerant quantum computation. MATH: - Stabilizer group S=⟨g1,g2,…,gm⟩ S = \langle g_1, g_2, \dots, g_m \rangle S=⟨g1​,g2​,…,gm​⟩ where each gi g_i gi​ is a Pauli operator (tensor product of X,Y,Z,I X, Y, Z, I X,Y,Z,I) on n n n qubits. - Parity check matrix H H H over F2 \mathbb{F}_2 F2​ (for X X X and Z Z Z errors separately) has size (n−k)×n (n-k) \times n (n−k)×n, with rows corresponding to stabilizer generators. - Surface code: qubits on edges of a square lattice, stabilizers are plaquette (Z-type) and vertex (X-type) operators. Code distance d d d scales with lattice size L L L: d=L d = L d=L for L×L L \times L L×L lattice. - Logical operators are non-trivial cycles on the dual lattice, with commutation relations given by intersection number mod 2. - Error correction threshold: pth≈0.103 p_{\text{th}} \approx 0.103 pth​≈0.103 (for standard depolarizing noise) — no simple rational ratio, but Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Topological quantum error correction (TQEC) uses lattice geometry—specifically the toric code and surface codes—to encode logical qubits non-locally, with error thresholds tied to lattice percolation and anyon braiding. MATH: - Toric code: Hamiltonian H=−∑vAv−∑pBp H = -\sum_v A_v - \sum_p B_p H=−∑v​Av​−∑p​Bp​, with star operators Av=∏i∈vXi A_v = \prod_{i \in v} X_i Av​=∏i∈v​Xi​ and plaquette operators Bp=∏i∈pZi B_p = \prod_{i \in p} Z_i Bp​=∏i∈p​Zi​. Ground state degeneracy on genus-ggg surface: 4g 4^g 4g. - Logical operators: non-contractible loops on torus — Xˉ,Zˉ \bar{X}, \bar{Z} Xˉ,Zˉ each have weight L L L (lattice length), minimum weight scales as O(L) O(L) O(L) for L×L L \times L L×L lattice. - Error threshold: surface code ~1.1% (per-qubit depolarizing), toric code ~10.1% (bit-flip only) — related to percolation threshold on square lattice pc≈0.593 p_c \approx 0.593 pc​≈0.593 (site) and pc≈0.5 p_c \approx 0.5 pc​≈0.5 (bond). - Anyon statistics: e e e (charge) and m m m (flux) excitations obey Z2 \mathbb{Z}_2 Z2​ fusion: e×m=ψ e \times m = \psi e×m=ψ Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Surface code logical error rate scales exponentially with code distance (lattice size), enabling practical quantum error correction via topological order. | MATH: Logical error rate PL∝(Λ)−dP_L \propto (\Lambda)^{-d}PL​∝(Λ)−d, where ddd = code distance (linear lattice dimension), Λ=Pth/Pphys\Lambda = P_{th}/P_{phys}Λ=Pth​/Pphys​ (error suppression factor per round). Threshold Pth≈0.01P_{th} \approx 0.01Pth​≈0.01 (1% per qubit per cycle). Physical-to-logical overhead scales as O(d2)O(d^2)O(d2) qubits per logical qubit. | CONNECTION: The surface code is a **Z₂ toric code** — a lattice gauge theory on a square lattice with **crystallographic symmetry (p4m plane group)**. The logical operators are **non-contractible loops** on the torus (genus-1 surface), whose weight scales as ddd — directly tied to the **topological winding number** and the **fundamental group π1(T2)=Z×Z\pi_1(T^2) = \mathbb{Z} \times \mathbb{Z}π1​(T2)=Z×Z**. The threshold ~1% is not a golden ratio, but the **error suppression per distance** Λ\LambdaΛ often approaches values Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Surface-code error correction thresholds align with percolation-theoretic critical probabilities in 2D lattices, establishing a deep equivalence between quantum error correction and classical statistical-mechanics phase transitions. | MATH: The surface code threshold is governed by the bond-percolation threshold pc p_c pc​ on the square lattice, pc=1/2 p_c = 1/2 pc​=1/2. For the Fibonacci Turaev–Viro code (non-Abelian anyons), thresholds map to golden-ratio-related critical exponents. The Kitaev toric code threshold satisfies pth=pc(square)=0.5 p_{\text{th}} = p_c(\text{square}) = 0.5 pth​=pc​(square)=0.5 for perfect syndrome measurement; with faulty measurements, the threshold drops to pth≈0.109 p_{\text{th}} \approx 0.109 pth​≈0.109 (matching the 2D random-bond Ising model multicritical point). LDPC codes (Delfosse) exhibit thresholds tied to the percolation transition on expander graphs, where the critical density satisfies pc∼1/d p_c \sim 1/d pc​∼1/d for degree-d d d graphs. | CONNECTION: The square-lattice percolation threshold \( p_c = Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Surface code logical operators are homology cycles on a torus lattice; error correction threshold is a phase transition point determined by percolation of string-like excitations. MATH: - Logical operators: X^L=∏i∈cycleXi \hat{X}_L = \prod_{i \in \text{cycle}} X_i X^L​=∏i∈cycle​Xi​, Z^L=∏j∈cocycleZj \hat{Z}_L = \prod_{j \in \text{cocycle}} Z_j Z^L​=∏j∈cocycle​Zj​; homology group H1(T2,Z2)≅Z22 H_1(\mathbb{T}^2, \mathbb{Z}_2) \cong \mathbb{Z}_2^2 H1​(T2,Z2​)≅Z22​. - Threshold: pth≈0.103 p_{\text{th}} \approx 0.103 pth​≈0.103 (for standard surface code under independent bit-flip/phase-flip noise); satisfies pth=12(1−12)≈0.146 p_{\text{th}} = \frac{1}{2} \left(1 - \frac{1}{\sqrt{2}}\right) \approx 0.146 pth​=21​(1−2​1​)≈0.146 for certain noise models (e.g., depolarizing). - Error correction condition: Pr(logical error)∼e−αL \text{Pr}(\text{logical error}) \sim e^{-\alpha L} Pr(logical error)∼e−αL for p<pth p < p_{\text{th}} p<pth​, with L L L lattice size; scaling exponent α \alpha α related to critical exponents of 2D random-bond Ising model. CONNECTION: - Homology cycles map to closed strings on a torus; threshold \( p_{\text{th}} \approx 0 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Surface code logical qubit error suppression scales with code distance ddd, with logical error rate PL∝(Λ)−(d+1)/2P_L \propto (\Lambda)^{-(d+1)/2}PL​∝(Λ)−(d+1)/2 where Λ\LambdaΛ is the error-limit parameter; Google's 2022 experiment demonstrated exponential suppression across d=3,5,7d=3,5,7d=3,5,7. MATH: - Logical error rate: PL∝Λ−(d+1)/2P_L \propto \Lambda^{-(d+1)/2}PL​∝Λ−(d+1)/2 (exponential in code distance) - Threshold condition: physical error rate p<pth≈0.01p < p_{th} \approx 0.01p<pth​≈0.01 (for standard surface code with depolarizing noise) - Stabilizer weight: w=4w = 4w=4 (X and Z plaquette operators on square lattice) - Logical operator weight: wL=dw_L = dwL​=d (minimum weight path across lattice) - Lattice: square grid, d×dd \times dd×d qubit array, d2d^2d2 data qubits + (d2−1)(d^2-1)(d2−1) ancilla qubits - Key ratio: PL/Pphys∼(Λ)−(d+1)/2P_L / P_{phys} \sim (\Lambda)^{-(d+1)/2}PL​/Pphys​∼(Λ)−(d+1)/2 where Λ≈pth/p\Lambda \approx p_{th}/pΛ≈pth​/p CONNECTION: - Square lattice = Z2Z^2Z2 root system (crystallographic, order 4 symmetry) — stabilizer generators are 4-body plaquette opera Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com