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

Percolation Theory Determines Topological Color Code Thresholds on Hexagonal and Square-Octagonal Lattices — E8 Intelligence Research

Andrew Stewart Caldin

Published Jul 28, 2026• 0 citations
Publisher

Abstract

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

DOI
10.5281/zenodo.21637146

Related papers

Topological Color Code Thresholds Mapped to Lattice-Dependent Percolation — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Topological color code accuracy thresholds on hexagonal and square-octagonal lattices are determined via mapping to spin models, revealing lattice-dependent percolation thresholds. | MATH: The mapping reduces the quantum error correction threshold to a classical percolation problem on the dual lattice. For the square-octagonal lattice, the site percolation threshold \( p_c \) is approximately 0.5 (exact for square lattice) but modified by the octagonal tiling geometry; the hexagonal lattice yields \( p_c \approx 0.6527 \) (site percolation on triangular lattice). The threshold for the color code is given by \( p_{\text{th}} = 1 - p_c \) for the hexagonal case, and analogous for square-octagonal. Key constants: hexagonal lattice percolation threshold \( p_c = 0.5 \) (bond) or 0.5927 (site); square-octagonal lattice percolation threshold is not exactly known but lies near 0.5–0.6. | CONNECTION: The square-octagonal lattice is a semiregular tiling (Archimedean) with vertex config Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 28, 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

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

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

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
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
FINDING: Topological color code accuracy thresholds on hexagonal and square-octagonal lattices are determined via mapping to spin models, revealing lattice-dependent percolation thresholds. | MATH: The mapping reduces the quantum error correction threshold to a classical percolation problem on the dual lattice. For the square-octagonal lattice, the site percolation threshold pc p_c pc​ is approximately 0.5 (exact for square lattice) but modified by the octagonal tiling geometry; the hexagonal lattice yields pc≈0.6527 p_c \approx 0.6527 pc​≈0.6527 (site percolation on triangular lattice). The threshold for the color code is given by pth=1−pc p_{\text{th}} = 1 - p_c pth​=1−pc​ for the hexagonal case, and analogous for square-octagonal. Key constants: hexagonal lattice percolation threshold pc=0.5 p_c = 0.5 pc​=0.5 (bond) or 0.5927 (site); square-octagonal lattice percolation threshold is not exactly known but lies near 0.5–0.6. | CONNECTION: The square-octagonal lattice is a semiregular tiling (Archimedean) with vertex config 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
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 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 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