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

Threshold Error Rate Scaling in Toric Code Topological Quantum Error Correction — E8 Intelligence Research

Andrew Stewart Caldin

Published Jul 27, 2026• 0 citations
Publisher

Abstract

FINDING: Topological quantum error correction (TQEC) using the toric code on a square lattice exhibits a threshold error rate for fault-tolerant quantum computation, scaling with lattice size and governed by a Z₂ gauge symmetry. MATH: - Toric code Hamiltonian: \( H = - \sum_v A_v - \sum_p B_p \), with \( A_v = \prod_{i \in v} \sigma_i^x \), \( B_p = \prod_{i \in p} \sigma_i^z \). - Stabilizer generators: \( A_v^2 = B_p^2 = I \), \( [A_v, B_p] = 0 \). - Logical operators: \( \bar{X} = \prod_{i \in \text{non-trivial cycle}} \sigma_i^x \), \( \bar{Z} = \prod_{i \in \text{non-trivial cocycle}} \sigma_i^z \). - Threshold error rate \( p_{\text{th}} \approx 0.109 \) (for perfect syndrome measurements) to \( \approx 0.103 \) (with circuit noise) — a dimensionless constant. - Scaling of logical error rate: \( p_L \propto (p / p_{\text{th}})^{L/2} \) for lattice size \( L \times L \). - Z₂ gauge symmetry: anyon types {1, e, m, ε} with fusion rules \( e \times m = ε \), \( e^2 = m^2 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.21617540

Related papers

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

Google AI Achieves Quantum Error Correction Below Threshold, Enabling Scalable Logical Qubits — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum error correction (QEC) milestone — Google AI demonstrates error suppression below threshold, enabling scalable logical qubits. | MATH: Key threshold constant: error rate per operation \( p < p_{\text{th}} \approx 0.57\% \) (surface code). Logical error rate scales as \( p_L \propto (p/p_{\text{th}})^{(d+1)/2} \) for code distance \( d \). | CONNECTION: Surface code is a topological lattice (square grid) with \( Z_2 \) symmetry — related to toric code, Kitaev's anyon model. Lattice structure: 4-fold rotational symmetry, no direct golden ratio. | DEPTH: 8 — foundational for fault-tolerant quantum computing, but no new geometric constant revealed. FINDING: Deltaflow — a full-stack QEC system achieving >10^4 reliable quantum operations (QuOps). | MATH: Logical fidelity \( F = 1 - \epsilon_L \), with \( \epsilon_L \approx c \cdot (p/p_{\text{th}})^{d/2} \). Target: \( 10^6 \) QuOps for useful computation. | CONNECTION: Error suppression follows power law in code distance — Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 11, 2026•0 citations

Google AI Achieves Fault-Tolerant Quantum Computation by Scaling Logical Qubit Fidelity Below Error Threshold — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum error correction (QEC) milestone — Google AI demonstrates scaling of logical qubit fidelity below physical qubit error threshold, enabling fault-tolerant quantum computation. | MATH: Key threshold: physical error rate \( p < p_{\text{th}} \approx 0.57\% \) for surface code; logical error rate \( p_L \propto (p/p_{\text{th}})^{(d+1)/2} \) where \( d \) is code distance; stabilizer formalism uses Pauli group \( \mathcal{P}_n \) and syndrome extraction via parity checks. | CONNECTION: Surface code is a topological QEC code based on a 2D square lattice (crystallographic symmetry \( p4m \)); code distance \( d \) corresponds to lattice size; logical operators are non-contractible loops on torus (homology). No direct golden ratio or base-60 link. | DEPTH: 8 — QEC is essential for scalable quantum computing; surface code threshold is a precise mathematical condition; topological nature ties to lattice geometry and homology, but no new fundamental constants or ratios emerge. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 27, 2026•0 citations

Google AI Achieves Sub-Threshold Quantum Error Correction for Logical Qubits — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum error correction (QEC) milestone — Google AI demonstrates error suppression below surface code threshold, enabling logical qubit operation with reduced physical error rates. | MATH: Surface code distance \(d\) yields logical error rate \(P_L \propto (p/p_{th})^{d/2}\) where \(p\) is physical error rate, \(p_{th} \approx 0.57\%\) for standard depolarizing noise; threshold condition \(p < p_{th}\). Stabilizer formalism uses Pauli group \(\mathcal{P}_n\) and syndrome extraction via \(n\) ancilla qubits. | CONNECTION: Surface code lattice is a 2D square grid (crystallographic symmetry \(p4m\) wallpaper group). Error correction cycles correspond to toric code on a planar boundary — topological order with anyonic excitations. No direct golden ratio or base-60 link. | DEPTH: 8 — milestone demonstrates fault-tolerant quantum memory below threshold, a necessary condition for scalable quantum computing. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 14, 2026•0 citations

Toric Code Topology: Genus, Symmetry, and Logical Operators — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The toric code is a topological quantum error-correcting code whose logical operators are non-contractible loops on a torus, with ground-state degeneracy determined by the genus of the surface and the group cohomology of the underlying lattice symmetry (p4m wallpaper group). | MATH: The toric code Hamiltonian \( H = -\sum_v A_v - \sum_p B_p \), where \( A_v = \prod_{i \in v} \sigma^x_i \) and \( B_p = \prod_{i \in p} \sigma^z_i \). Logical operators \( X_L, Z_L \) are non-contractible loops; on a genus-\(g\) surface, degeneracy \( = 4^g \). For the p4m wallpaper group (square lattice with reflection/rotation symmetries), the code space is invariant under the group action; the anyonic excitations (e, m, ε) obey \( \mathbb{Z}_2 \times \mathbb{Z}_2 \) fusion rules, and the braiding phase is \( e^{i\pi} = -1 \). | CONNECTION: The p4m group is the full symmetry group of the square lattice — its point group is \( D_4 \) (order 8), with generators \( r \) (90° rotation) and \( s \) ( Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 24, 2026•0 citations
FINDING: Topological quantum error correction (TQEC) using the toric code on a square lattice exhibits a threshold error rate for fault-tolerant quantum computation, scaling with lattice size and governed by a Z₂ gauge symmetry. MATH: - Toric code Hamiltonian: ( H = - \sum_v A_v - \sum_p B_p ), with ( A_v = \prod_{i \in v} \sigma_i^x ), ( B_p = \prod_{i \in p} \sigma_i^z ). - Stabilizer generators: ( A_v^2 = B_p^2 = I ), ( [A_v, B_p] = 0 ). - Logical operators: ( \bar{X} = \prod_{i \in \text{non-trivial cycle}} \sigma_i^x ), ( \bar{Z} = \prod_{i \in \text{non-trivial cocycle}} \sigma_i^z ). - Threshold error rate ( p_{\text{th}} \approx 0.109 ) (for perfect syndrome measurements) to ( \approx 0.103 ) (with circuit noise) — a dimensionless constant. - Scaling of logical error rate: ( p_L \propto (p / p_{\text{th}})^{L/2} ) for lattice size ( L \times L ). - Z₂ gauge symmetry: anyon types {1, e, m, ε} with fusion rules ( e \times m = ε ), ( e^2 = m^2 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: Quantum error correction (QEC) milestone — Google AI demonstrates error suppression below threshold, enabling scalable logical qubits. | MATH: Key threshold constant: error rate per operation p<pth≈0.57% p < p_{\text{th}} \approx 0.57\% p<pth​≈0.57% (surface code). Logical error rate scales as pL∝(p/pth)(d+1)/2 p_L \propto (p/p_{\text{th}})^{(d+1)/2} pL​∝(p/pth​)(d+1)/2 for code distance d d d. | CONNECTION: Surface code is a topological lattice (square grid) with Z2 Z_2 Z2​ symmetry — related to toric code, Kitaev's anyon model. Lattice structure: 4-fold rotational symmetry, no direct golden ratio. | DEPTH: 8 — foundational for fault-tolerant quantum computing, but no new geometric constant revealed. FINDING: Deltaflow — a full-stack QEC system achieving >10^4 reliable quantum operations (QuOps). | MATH: Logical fidelity F=1−ϵL F = 1 - \epsilon_L F=1−ϵL​, with ϵL≈c⋅(p/pth)d/2 \epsilon_L \approx c \cdot (p/p_{\text{th}})^{d/2} ϵL​≈c⋅(p/pth​)d/2. Target: 106 10^6 106 QuOps for useful computation. | CONNECTION: Error suppression follows power law in code distance — Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Quantum error correction (QEC) milestone — Google AI demonstrates scaling of logical qubit fidelity below physical qubit error threshold, enabling fault-tolerant quantum computation. | MATH: Key threshold: physical error rate p<pth≈0.57% p < p_{\text{th}} \approx 0.57\% p<pth​≈0.57% for surface code; logical error rate pL∝(p/pth)(d+1)/2 p_L \propto (p/p_{\text{th}})^{(d+1)/2} pL​∝(p/pth​)(d+1)/2 where d d d is code distance; stabilizer formalism uses Pauli group Pn \mathcal{P}_n Pn​ and syndrome extraction via parity checks. | CONNECTION: Surface code is a topological QEC code based on a 2D square lattice (crystallographic symmetry p4m p4m p4m); code distance d d d corresponds to lattice size; logical operators are non-contractible loops on torus (homology). No direct golden ratio or base-60 link. | DEPTH: 8 — QEC is essential for scalable quantum computing; surface code threshold is a precise mathematical condition; topological nature ties to lattice geometry and homology, but no new fundamental constants or ratios emerge. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Quantum error correction (QEC) milestone — Google AI demonstrates error suppression below surface code threshold, enabling logical qubit operation with reduced physical error rates. | MATH: Surface code distance ddd yields logical error rate PL∝(p/pth)d/2P_L \propto (p/p_{th})^{d/2}PL​∝(p/pth​)d/2 where ppp is physical error rate, pth≈0.57%p_{th} \approx 0.57\%pth​≈0.57% for standard depolarizing noise; threshold condition p<pthp < p_{th}p<pth​. Stabilizer formalism uses Pauli group Pn\mathcal{P}_nPn​ and syndrome extraction via nnn ancilla qubits. | CONNECTION: Surface code lattice is a 2D square grid (crystallographic symmetry p4mp4mp4m wallpaper group). Error correction cycles correspond to toric code on a planar boundary — topological order with anyonic excitations. No direct golden ratio or base-60 link. | DEPTH: 8 — milestone demonstrates fault-tolerant quantum memory below threshold, a necessary condition for scalable quantum computing. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: The toric code is a topological quantum error-correcting code whose logical operators are non-contractible loops on a torus, with ground-state degeneracy determined by the genus of the surface and the group cohomology of the underlying lattice symmetry (p4m wallpaper group). | MATH: The toric code Hamiltonian H=−∑vAv−∑pBp H = -\sum_v A_v - \sum_p B_p H=−∑v​Av​−∑p​Bp​, where Av=∏i∈vσix A_v = \prod_{i \in v} \sigma^x_i Av​=∏i∈v​σix​ and Bp=∏i∈pσiz B_p = \prod_{i \in p} \sigma^z_i Bp​=∏i∈p​σiz​. Logical operators XL,ZL X_L, Z_L XL​,ZL​ are non-contractible loops; on a genus-ggg surface, degeneracy =4g = 4^g =4g. For the p4m wallpaper group (square lattice with reflection/rotation symmetries), the code space is invariant under the group action; the anyonic excitations (e, m, ε) obey Z2×Z2 \mathbb{Z}_2 \times \mathbb{Z}_2 Z2​×Z2​ fusion rules, and the braiding phase is eiπ=−1 e^{i\pi} = -1 eiπ=−1. | CONNECTION: The p4m group is the full symmetry group of the square lattice — its point group is D4 D_4 D4​ (order 8), with generators r r r (90° rotation) and s s s ( Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com