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

Proof of a positive coherent-error threshold for topological quantum codes — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 7, 2026• 0 citations
Publisher

Abstract

Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted $Z$ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent $Z$-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof com Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24029498

Related papers

Proof of a positive coherent-error threshold for topological quantum codes

Shiro Tamiya, Masato Koashi

Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted $Z$ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent $Z$-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof combines Fourier analysis to retain the interference among the amplitudes of coherent errors with the cluster expansion of abstract polymer models. Our results expand the theoretical foundation of quantum error correction and offer a statistical-mechanical description of quantum error correction beyond stochastic errors.

quant-pharXiv:2609.20708•Sep 18, 2026•1 citation

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 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

Coherent error threshold for quantum LDPC codes

Zhengyi Han, Yuanchen Zhao, Yijia Xu +2 more

A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance $d=Ω(\log n)$, we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.

quant-pharXiv:2609.20537•Sep 18, 2026•1 citation

Scaling Laws and 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 for this scaling. MATH: For a surface code with distance \(d\), logical error rate \(p_L \approx C (p/p_{th})^{d/2}\) (or \(p_L \propto (p/p_{th})^{\lfloor (d+1)/2 \rfloor}\) depending on boundary conditions), where \(p\) is physical error rate and \(p_{th}\) is the threshold (~1% for standard surface codes under circuit-level noise). The quasi-threshold \(p^*\) satisfies \(p_L(p^*) = p^*\), i.e., the fixed point of the error correction map. Stabilizer formalism: code space is the simultaneous +1 eigenspace of generators \(S_i\) in the Pauli group, with \(S_i^2 = I\), \([S_i,S_j]=0\). Logical operators \(X_L, Z_L\) commute with all \(S_i\) but are not in the stabilizer group. The number of encoded qubits \(k = n - r\) (n physical, r independent stabilizer generat Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 2, 2026•0 citations
Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted ZZZ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent ZZZ-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof com Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Threshold analyses of quantum error-correcting codes are well established for stochastic error models, in which errors occur randomly with given probabilities. However, errors in actual devices can also be coherent, such as unwanted ZZZ rotations due to imperfect control, which are not captured by stochastic error models. For the surface code, numerical studies have indicated threshold behavior even under coherent errors, but a rigorous proof of threshold existence is lacking. Here we prove that a positive threshold for coherent ZZZ-rotation errors exists for quantum low-density parity-check codes with a bounded number of logical qubits, including the surface code and other topological codes. Specifically, we show that the maximum-likelihood Pauli recovery suppresses the entanglement infidelity exponentially in the code distance up to a prefactor linear in the number of physical qubits whenever the rotation angles lie below a constant that is independent of the code size. The proof combines Fourier analysis to retain the interference among the amplitudes of coherent errors with the cluster expansion of abstract polymer models. Our results expand the theoretical foundation of quantum error correction and offer a statistical-mechanical description of quantum error correction beyond stochastic errors.
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 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
A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance d=Ω(log⁡n)d=Ω(\log n)d=Ω(logn), we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.
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 for this scaling. MATH: For a surface code with distance ddd, logical error rate pL≈C(p/pth)d/2p_L \approx C (p/p_{th})^{d/2}pL​≈C(p/pth​)d/2 (or pL∝(p/pth)⌊(d+1)/2⌋p_L \propto (p/p_{th})^{\lfloor (d+1)/2 \rfloor}pL​∝(p/pth​)⌊(d+1)/2⌋ depending on boundary conditions), where ppp is physical error rate and pthp_{th}pth​ is the threshold (~1% for standard surface codes under circuit-level noise). The quasi-threshold p∗p^*p∗ satisfies pL(p∗)=p∗p_L(p^*) = p^*pL​(p∗)=p∗, i.e., the fixed point of the error correction map. Stabilizer formalism: code space is the simultaneous +1 eigenspace of generators SiS_iSi​ in the Pauli group, with Si2=IS_i^2 = ISi2​=I, [Si,Sj]=0[S_i,S_j]=0[Si​,Sj​]=0. Logical operators XL,ZLX_L, Z_LXL​,ZL​ commute with all SiS_iSi​ but are not in the stabilizer group. The number of encoded qubits k=n−rk = n - rk=n−r (n physical, r independent stabilizer generat Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com