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

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

Andrew Stewart Caldin

Published Oct 5, 2026• 0 citations
Publisher

Abstract

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

DOI
10.5281/zenodo.23152177

Related papers

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

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

Scaling Laws and Quasi-Thresholds in Surface Code Error Correction — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface code logical error rate scales exponentially with code distance, with a quasi-threshold defining the crossover where error correction becomes beneficial; stabilizer formalism provides the algebraic framework. MATH: For a surface code with distance \(d\), logical error rate \(p_L \approx C (p/p_{th})^{(d+1)/2}\), where \(p\) is physical error rate and \(p_{th}\) is the threshold (~1% for standard surface codes under circuit-level noise). Quasi-threshold \(p_q(d)\) satisfies \(p_L(p_q) = p_q\), giving \(p_q \approx p_{th} (1 - \text{const}/d)\). Stabilizer formalism: code space is joint \(+1\) eigenspace of \(n-k\) independent Pauli operators \(S_i\), with \(S_i^2 = I\), \([S_i,S_j]=0\). Logical operators \(L\) satisfy \([L,S_i]=0\), \(L \notin \langle S_i \rangle\). Decoding via minimum-weight perfect matching (MWPM) on the syndrome graph — a planar lattice with \(O(d^2)\) vertices. CONNECTION: The surface code is a topological code on a square lattice — a \(Z_2\) g Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 24, 2026•0 citations

Wallpaper Group Symmetry Governs Toric Code Logical Operators and Thresholds — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface codes (toric code) are stabilizer codes whose logical operators and error-correction thresholds are governed by the p4m wallpaper group symmetry of the square lattice, with transversal diagonal logical operators constrained by lattice automorphisms. | MATH: Toric code: 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, B_p]=0\). Logical operators: non-contractible loops \(Z_L, X_L\) on torus, giving \(k=2\) logical qubits. Distance \(d = O(L)\) for \(L \times L\) lattice. Transversal diagonal logical operators: for CSS codes, diagonal gates in Clifford hierarchy \(\mathcal{C}_k\) correspond to codes with certain weight conditions — Webster (arXiv:2303.15615) classifies these via code automorphism groups. p4m group: generated by translations \((1,0),(0,1)\), 90° rotation, and two reflections; order 8 point group \(D_4\). | CONNECTION: p4m is the full symmetry group of the square latti Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 3, 2026•0 citations

Topological Color Code Threshold Ratio Maps to 2D Ising Universality Class — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Topological color code threshold ratio near unity maps to 2D Ising universality class, revealing a critical constant. | MATH: The accuracy threshold for topological color codes on hexagonal and square-octagonal lattices is determined via mapping to a random-bond Ising model. The critical point of the 2D Ising model is at \( \beta_c = \frac{1}{2} \ln(1+\sqrt{2}) \approx 0.4407 \). The threshold ratio (error rate per qubit) is found to be \( p_{\text{th}} \approx 0.109 \) for the hexagonal lattice and \( p_{\text{th}} \approx 0.112 \) for the square-octagonal lattice. These values are not near unity but are consistent with the 2D Ising universality class, meaning the critical exponents (e.g., \( \nu = 1 \), \( \eta = 1/4 \)) match. | CONNECTION: The hexagonal lattice is a 2D crystallographic tiling with 6-fold rotational symmetry. The square-octagonal lattice (also known as the truncated square tiling) has 4-fold symmetry and is a semiregular tiling. Both lattices are bipartite, Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 30, 2026•0 citations
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
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
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, with a quasi-threshold defining the crossover where error correction becomes beneficial; stabilizer formalism provides the algebraic framework. MATH: For a surface code with distance ddd, logical error rate pL≈C(p/pth)(d+1)/2p_L \approx C (p/p_{th})^{(d+1)/2}pL​≈C(p/pth​)(d+1)/2, where ppp is physical error rate and pthp_{th}pth​ is the threshold (~1% for standard surface codes under circuit-level noise). Quasi-threshold pq(d)p_q(d)pq​(d) satisfies pL(pq)=pqp_L(p_q) = p_qpL​(pq​)=pq​, giving pq≈pth(1−const/d)p_q \approx p_{th} (1 - \text{const}/d)pq​≈pth​(1−const/d). Stabilizer formalism: code space is joint +1+1+1 eigenspace of n−kn-kn−k independent Pauli operators SiS_iSi​, with Si2=IS_i^2 = ISi2​=I, [Si,Sj]=0[S_i,S_j]=0[Si​,Sj​]=0. Logical operators LLL satisfy [L,Si]=0[L,S_i]=0[L,Si​]=0, L∉⟨Si⟩L \notin \langle S_i \rangleL∈/⟨Si​⟩. Decoding via minimum-weight perfect matching (MWPM) on the syndrome graph — a planar lattice with O(d2)O(d^2)O(d2) vertices. CONNECTION: The surface code is a topological code on a square lattice — a Z2Z_2Z2​ g Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Surface codes (toric code) are stabilizer codes whose logical operators and error-correction thresholds are governed by the p4m wallpaper group symmetry of the square lattice, with transversal diagonal logical operators constrained by lattice automorphisms. | MATH: Toric code: 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 [Av,Bp]=0[A_v, B_p]=0[Av​,Bp​]=0. Logical operators: non-contractible loops ZL,XLZ_L, X_LZL​,XL​ on torus, giving k=2k=2k=2 logical qubits. Distance d=O(L)d = O(L)d=O(L) for L×LL \times LL×L lattice. Transversal diagonal logical operators: for CSS codes, diagonal gates in Clifford hierarchy Ck\mathcal{C}_kCk​ correspond to codes with certain weight conditions — Webster (arXiv:2303.15615) classifies these via code automorphism groups. p4m group: generated by translations (1,0),(0,1)(1,0),(0,1)(1,0),(0,1), 90° rotation, and two reflections; order 8 point group D4D_4D4​. | CONNECTION: p4m is the full symmetry group of the square latti Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Topological color code threshold ratio near unity maps to 2D Ising universality class, revealing a critical constant. | MATH: The accuracy threshold for topological color codes on hexagonal and square-octagonal lattices is determined via mapping to a random-bond Ising model. The critical point of the 2D Ising model is at βc=12ln⁡(1+2)≈0.4407 \beta_c = \frac{1}{2} \ln(1+\sqrt{2}) \approx 0.4407 βc​=21​ln(1+2​)≈0.4407. The threshold ratio (error rate per qubit) is found to be pth≈0.109 p_{\text{th}} \approx 0.109 pth​≈0.109 for the hexagonal lattice and pth≈0.112 p_{\text{th}} \approx 0.112 pth​≈0.112 for the square-octagonal lattice. These values are not near unity but are consistent with the 2D Ising universality class, meaning the critical exponents (e.g., ν=1 \nu = 1 ν=1, η=1/4 \eta = 1/4 η=1/4) match. | CONNECTION: The hexagonal lattice is a 2D crystallographic tiling with 6-fold rotational symmetry. The square-octagonal lattice (also known as the truncated square tiling) has 4-fold symmetry and is a semiregular tiling. Both lattices are bipartite, Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com