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 Code Threshold as Percolation Phase Transition on Torus Homology — E8 Intelligence Research

Andrew Stewart Caldin

Published Jul 28, 2026• 0 citations
Publisher

Abstract

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

DOI
10.5281/zenodo.21637123

Related papers

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 Codes as B2 Root Systems with Percolation-Like Error Thresholds — E8 Intelligence Research

Andrew Stewart Caldin

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

•Aug 24, 2026•0 citations

Topological Order Dictates Surface Code Thresholds, XZZX Optimal Under Biased Noise — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface code error thresholds are governed by the topological order of a 2D lattice, with the XZZX variant achieving optimal thresholds under biased noise via a mapping to a classical disordered magnet (random-bond Ising model). | MATH: Surface code threshold ≈ 10.3% (depolarizing) for standard toric code; XZZX code threshold → 50% under pure Z-biased noise (theoretical limit). The decoding problem maps exactly to the random-bond Ising model (RBIM) on a square lattice with Nishimori condition: \( \beta J = \frac{1}{2} \ln\left(\frac{p}{1-p}\right) \), where \(p\) is the error rate. The threshold is the Nishimori critical point: \( p_c \approx 0.1093(2) \) for the standard case, and \( p_c \to 0.5 \) for pure Z-bias. The stabilizer group is \( \mathbb{Z}_2 \times \mathbb{Z}_2 \) per plaquette/vertex, with anyonic excitations (e, m, ε) obeying fusion rules \( e \times m = \varepsilon \). | CONNECTION: The surface code lives on a square lattice — a **crystallographic group p4m** Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 5, 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 Theory Determines Topological Color Code Thresholds on Hexagonal and Square-Octagonal Lattices — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Topological color codes on hexagonal and square-octagonal lattices exhibit accuracy thresholds determined by percolation theory, with mapping to spin models revealing critical ratios. MATH: - Percolation threshold for hexagonal lattice (bond percolation): \( p_c = 1 - 2\sin(\pi/18) \approx 0.6527 \) - For square-octagonal lattice: \( p_c \approx 0.6764 \) (exact value from 2D percolation theory) - Accuracy threshold ratio (hexagonal vs square-octagonal): \( \approx 0.6527 / 0.6764 \approx 0.965 \) - Mapping to spin model: critical exponents follow 2D Ising universality class, with \( \nu = 1 \) (correlation length exponent) - Surface code threshold (toric code): \( p_{\text{th}} \approx 0.103 \) (for standard square lattice, from depolarizing noise) CONNECTION: - Hexagonal lattice: 6-fold rotational symmetry (crystallographic point group \( D_6 \)), bond angles \( 120^\circ \) — related to hexagonal close-packing and graphene structure. - Square-octagonal lat Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 28, 2026•0 citations
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
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 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 Av=∏e∋vXeA_v = \prod_{e \ni v} X_eAv​=∏e∋v​Xe​ and plaquette operators Bp=∏e∈∂pZeB_p = \prod_{e \in \partial p} Z_eBp​=∏e∈∂p​Ze​, with Av2=Bp2=IA_v^2 = B_p^2 = IAv2​=Bp2​=I, [Av,Bp]=0[A_v, B_p] = 0[Av​,Bp​]=0. - Logical operators: non-contractible loops — XXX-type along a horizontal cycle, ZZZ-type along a vertical cycle; logical Pauli algebra Xˉ,Zˉ\bar{X}, \bar{Z}Xˉ,Zˉ with XˉZˉ=−ZˉXˉ\bar{X}\bar{Z} = -\bar{Z}\bar{X}XˉZˉ=−ZˉXˉ. - Distance ddd = minimum weight of logical operator = lattice dimension LLL (for L×LL \times LL×L patch); code rate k/n=1/(2L2−2L+1)k/n = 1/(2L^2 - 2L + 1)k/n=1/(2L2−2L+1). - Error threshold: pth≈0.103p_{\text{th}} \approx 0.103pth​≈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 thresholds are governed by the topological order of a 2D lattice, with the XZZX variant achieving optimal thresholds under biased noise via a mapping to a classical disordered magnet (random-bond Ising model). | MATH: Surface code threshold ≈ 10.3% (depolarizing) for standard toric code; XZZX code threshold → 50% under pure Z-biased noise (theoretical limit). The decoding problem maps exactly to the random-bond Ising model (RBIM) on a square lattice with Nishimori condition: βJ=12ln⁡(p1−p) \beta J = \frac{1}{2} \ln\left(\frac{p}{1-p}\right) βJ=21​ln(1−pp​), where ppp is the error rate. The threshold is the Nishimori critical point: pc≈0.1093(2) p_c \approx 0.1093(2) pc​≈0.1093(2) for the standard case, and pc→0.5 p_c \to 0.5 pc​→0.5 for pure Z-bias. The stabilizer group is Z2×Z2 \mathbb{Z}_2 \times \mathbb{Z}_2 Z2​×Z2​ per plaquette/vertex, with anyonic excitations (e, m, ε) obeying fusion rules e×m=ε e \times m = \varepsilon e×m=ε. | CONNECTION: The surface code lives on a square lattice — a **crystallographic group p4m** 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: Topological color codes on hexagonal and square-octagonal lattices exhibit accuracy thresholds determined by percolation theory, with mapping to spin models revealing critical ratios. MATH: - Percolation threshold for hexagonal lattice (bond percolation): pc=1−2sin⁡(π/18)≈0.6527 p_c = 1 - 2\sin(\pi/18) \approx 0.6527 pc​=1−2sin(π/18)≈0.6527 - For square-octagonal lattice: pc≈0.6764 p_c \approx 0.6764 pc​≈0.6764 (exact value from 2D percolation theory) - Accuracy threshold ratio (hexagonal vs square-octagonal): ≈0.6527/0.6764≈0.965 \approx 0.6527 / 0.6764 \approx 0.965 ≈0.6527/0.6764≈0.965 - Mapping to spin model: critical exponents follow 2D Ising universality class, with ν=1 \nu = 1 ν=1 (correlation length exponent) - Surface code threshold (toric code): pth≈0.103 p_{\text{th}} \approx 0.103 pth​≈0.103 (for standard square lattice, from depolarizing noise) CONNECTION: - Hexagonal lattice: 6-fold rotational symmetry (crystallographic point group D6 D_6 D6​), bond angles 120∘ 120^\circ 120∘ — related to hexagonal close-packing and graphene structure. - Square-octagonal lat Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com