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

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

Authors

Publication Details

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

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

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

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

Andrew Stewart Caldin
preprint en

Abstract

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

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
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.