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

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

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-07-28
DOI
https://doi.org/10.5281/zenodo.21637123
Primary Topic
Topological and Geometric Data Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

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

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Topological and Geometric Data Analysis
preprint

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

Andrew Stewart Caldin
preprint en

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

Zenodo (CERN European Organization for Nuclear Research)
Topological and Geometric Data Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.