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

arXiv:2611.07017

Threshold-Free Symmetry-Enriched Topological Quantum Memory

Abhijat Sarma, Ruochen Ma, Cenke Xu

Published Nov 4, 2026• 0 citations
arXivHTMLPDF

Abstract

We show that non-Abelian symmetry enrichment can protect a toric code memory against incoherent electric noise at any bond error probability $p\in[0,1]$. For a toric code on the honeycomb lattice coupled to $Sp(N)$ rotors, with electric anyons carrying the fundamental representation, we construct an efficient minimum-weight decoder whose logical error probability decays exponentially with system size for $N\ge40$, a conservative sufficient bound. The same decoder also rules out strong-to-weak spontaneous symmetry breaking in the fundamental channel of $Sp(N)$ under the corresponding local decoherence in two dimensions. The construction extends to other symmetries, including $SU(N)$.

DOI
10.48550/arxiv.2611.07017

Related papers

Charge-Informed Quantum Error Correction

Vlad Temkin, Zack Weinstein, Ruihua Fan +2 more

We investigate the statistical physics of quantum error correction in ${\rm U}(1)$ symmetry-enriched topological quantum memories. Starting from a phenomenological error model of charge-conserving noise, we study the optimal decoder assuming the local charges of each anyon can be measured. The error threshold of the optimal decoder corresponds to a continuous phase transition in a disordered two-dimensional integer loop model on the Nishimori line. Using an effective replica field theory analysis and Monte Carlo numerics, we show that the optimal decoding transition exhibits Berezinskii-Kosterlitz-Thouless universality with a modified universal jump in winding number variance. We further generalize the model beyond the Nishimori line, which defines a large class of suboptimal decoders. At low nonzero temperatures and strong disorder, we find numerical evidence of a disorder-dominated loop-glass phase which corresponds to a "confidently incorrect" decoder. The zero-temperature limit defines the minimum-cost flow decoder, which serves as the ${\rm U}(1)$ analog of minimum-weight perfect matching in $\mathbb{Z}_2$ topological codes. Both the optimal and minimum-cost flow decoders are shown to dramatically outperform the charge-agnostic optimal decoder in symmetry-enriched topological codes.

quant-pharXiv:2512.22119•Dec 29, 2025•13 citations

Decoding coherent errors in toric codes on honeycomb and square lattices: duality to Majorana monitored dynamics and symmetry classes

Zhou Yang, Andreas W. W. Ludwig, Chao-Ming Jian

Topological stabilizer codes, such as the toric and surface codes, are leading candidates for fault-tolerant quantum computation. While their decodability under stochastic noise has been extensively studied, the effects of coherent errors, which involve quantum interference, remain less explored. In this work, we study the decodability of toric codes on honeycomb and square lattices subject to $X$- and $Z$-type coherent errors generated by the $X$- and $Z$-rotations on each qubit. We establish a duality between these decoding problems and 1+1D monitored dynamics of non-interacting Majorana fermions. This duality shows that the Altland-Zirnbauer symmetry class of the dual Majorana dynamics governs the universal structure of the decodability phase diagram. We show that the honeycomb-lattice toric code (hTC) with $X$-type error is dual to class-DIII dynamics, while the hTC with $Z$-type error and the square-lattice toric code (sTC) with both error types are dual to class-D dynamics. The key distinction arises from time-reversal symmetry. In class DIII, the generic transition out of the decodable phase is dual to a measurement-induced transition between dynamical phases with area-law and logarithmic entanglement scaling. In contrast, in class D, the generic decodability transition corresponds to a transition between two topologically distinct area-law phases. To explore these transitions in microscopic models, we consider hTC and sTC with $X$-type errors as representatives and introduce a minimal two-parameter coherent error model with spatially varying rotation angles. Using analytical and numerical methods, we map out the decodability phase diagrams and characterize the universal behavior of the transitions. We find that the decodability of sTC is more vulnerable to spatially varying coherent errors than uniform ones.

cond-mat.stat-mechCross-listedarXiv:2604.08650•Apr 13, 2026•9 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

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

Andrew Stewart Caldin

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

•Jul 27, 2026•0 citations

A local automaton for the 2D toric code

Shankar Balasubramanian, Margarita D. Davydova, Ethan Lake

We construct a local decoder for the 2D toric code using ideas from the hierarchical classical cellular automata of Tsirelson and Gács. Our decoder is a circuit of strictly local quantum operations preserving a logical state for exponential time in the presence of circuit-level noise without the need for non-local classical computation or communication. Our construction is not translation invariant in spacetime, but can be made time-translation invariant in 3D with stacks of 2D toric codes. This solves the open problem of constructing a local topological quantum memory below four dimensions.

arXiv:2412.19803•Quantum•Jun 2, 2026•33 citations

Topological Quantum Error-Correcting Thresholds of a Symmetry-Enriched Toric Code

Jiasheng He, Ryan Thorngren

We study the error thresholds of a new topological quantum error-correcting code under the independent bit-flip and phase-flip noisy channel. By mapping to classical spin-glass models, we find that if Pauli X and Z errors are equally probable, the threshold of vertex syndromes is improved by 30% compared to that of the toric code, while the threshold of plaquette syndromes is lowered. Both thresholds increase when the Z component is less likely than the X component, reaching 0.5 if the Z component is absent. An analytical proof justifies this special case of perfect correctability, and a disordered version of Peierls's argument establishes a lower bound for the vertex-syndrome threshold.

quant-pharXiv:2610.37791•Oct 29, 2026•1 citation
We show that non-Abelian symmetry enrichment can protect a toric code memory against incoherent electric noise at any bond error probability p∈[0,1]p\in[0,1]p∈[0,1]. For a toric code on the honeycomb lattice coupled to Sp(N)Sp(N)Sp(N) rotors, with electric anyons carrying the fundamental representation, we construct an efficient minimum-weight decoder whose logical error probability decays exponentially with system size for N≥40N\ge40N≥40, a conservative sufficient bound. The same decoder also rules out strong-to-weak spontaneous symmetry breaking in the fundamental channel of Sp(N)Sp(N)Sp(N) under the corresponding local decoherence in two dimensions. The construction extends to other symmetries, including SU(N)SU(N)SU(N).
We investigate the statistical physics of quantum error correction in U(1){\rm U}(1)U(1) symmetry-enriched topological quantum memories. Starting from a phenomenological error model of charge-conserving noise, we study the optimal decoder assuming the local charges of each anyon can be measured. The error threshold of the optimal decoder corresponds to a continuous phase transition in a disordered two-dimensional integer loop model on the Nishimori line. Using an effective replica field theory analysis and Monte Carlo numerics, we show that the optimal decoding transition exhibits Berezinskii-Kosterlitz-Thouless universality with a modified universal jump in winding number variance. We further generalize the model beyond the Nishimori line, which defines a large class of suboptimal decoders. At low nonzero temperatures and strong disorder, we find numerical evidence of a disorder-dominated loop-glass phase which corresponds to a "confidently incorrect" decoder. The zero-temperature limit defines the minimum-cost flow decoder, which serves as the U(1){\rm U}(1)U(1) analog of minimum-weight perfect matching in Z2\mathbb{Z}_2Z2​ topological codes. Both the optimal and minimum-cost flow decoders are shown to dramatically outperform the charge-agnostic optimal decoder in symmetry-enriched topological codes.
Topological stabilizer codes, such as the toric and surface codes, are leading candidates for fault-tolerant quantum computation. While their decodability under stochastic noise has been extensively studied, the effects of coherent errors, which involve quantum interference, remain less explored. In this work, we study the decodability of toric codes on honeycomb and square lattices subject to XXX- and ZZZ-type coherent errors generated by the XXX- and ZZZ-rotations on each qubit. We establish a duality between these decoding problems and 1+1D monitored dynamics of non-interacting Majorana fermions. This duality shows that the Altland-Zirnbauer symmetry class of the dual Majorana dynamics governs the universal structure of the decodability phase diagram. We show that the honeycomb-lattice toric code (hTC) with XXX-type error is dual to class-DIII dynamics, while the hTC with ZZZ-type error and the square-lattice toric code (sTC) with both error types are dual to class-D dynamics. The key distinction arises from time-reversal symmetry. In class DIII, the generic transition out of the decodable phase is dual to a measurement-induced transition between dynamical phases with area-law and logarithmic entanglement scaling. In contrast, in class D, the generic decodability transition corresponds to a transition between two topologically distinct area-law phases. To explore these transitions in microscopic models, we consider hTC and sTC with XXX-type errors as representatives and introduce a minimal two-parameter coherent error model with spatially varying rotation angles. Using analytical and numerical methods, we map out the decodability phase diagrams and characterize the universal behavior of the transitions. We find that the decodability of sTC is more vulnerable to spatially varying coherent errors than uniform ones.
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: 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=−∑vAv−∑pBp H = - \sum_v A_v - \sum_p B_p H=−∑v​Av​−∑p​Bp​, with Av=∏i∈vσix A_v = \prod_{i \in v} \sigma_i^x Av​=∏i∈v​σix​, Bp=∏i∈pσiz B_p = \prod_{i \in p} \sigma_i^z Bp​=∏i∈p​σiz​. - Stabilizer generators: Av2=Bp2=I A_v^2 = B_p^2 = I Av2​=Bp2​=I, [Av,Bp]=0 [A_v, B_p] = 0 [Av​,Bp​]=0. - Logical operators: Xˉ=∏i∈non-trivial cycleσix \bar{X} = \prod_{i \in \text{non-trivial cycle}} \sigma_i^x Xˉ=∏i∈non-trivial cycle​σix​, Zˉ=∏i∈non-trivial cocycleσiz \bar{Z} = \prod_{i \in \text{non-trivial cocycle}} \sigma_i^z Zˉ=∏i∈non-trivial cocycle​σiz​. - Threshold error rate pth≈0.109 p_{\text{th}} \approx 0.109 pth​≈0.109 (for perfect syndrome measurements) to ≈0.103 \approx 0.103 ≈0.103 (with circuit noise) — a dimensionless constant. - Scaling of logical error rate: pL∝(p/pth)L/2 p_L \propto (p / p_{\text{th}})^{L/2} pL​∝(p/pth​)L/2 for lattice size L×L L \times L L×L. - Z₂ gauge symmetry: anyon types {1, e, m, ε} with fusion rules e×m=ε e \times m = ε e×m=ε, \( e^2 = m^2 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We construct a local decoder for the 2D toric code using ideas from the hierarchical classical cellular automata of Tsirelson and Gács. Our decoder is a circuit of strictly local quantum operations preserving a logical state for exponential time in the presence of circuit-level noise without the need for non-local classical computation or communication. Our construction is not translation invariant in spacetime, but can be made time-translation invariant in 3D with stacks of 2D toric codes. This solves the open problem of constructing a local topological quantum memory below four dimensions.
We study the error thresholds of a new topological quantum error-correcting code under the independent bit-flip and phase-flip noisy channel. By mapping to classical spin-glass models, we find that if Pauli X and Z errors are equally probable, the threshold of vertex syndromes is improved by 30% compared to that of the toric code, while the threshold of plaquette syndromes is lowered. Both thresholds increase when the Z component is less likely than the X component, reaching 0.5 if the Z component is absent. An analytical proof justifies this special case of perfect correctability, and a disordered version of Peierls's argument establishes a lower bound for the vertex-syndrome threshold.