Toric Code: Topological Order, Anyon, Quantum Error Correction (QEC) Codes and Fault-Tolerant Quantum Computation

The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads. In this work, we introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions, enabling the exploration of generalized toric codes with larger logical dimensions on twisted tori. Using Gröbner bases, we simplify stabilizer syndromes to efficiently identify anyon excitations and their geometric periodicities, even under twisted periodic boundary conditions. Since the properties of the codes are determined by the anyons, this approach allows us to directly compute the logical dimensions without constructing large parity-check matrices. Our approach provides a unified method for finding new quantum error-correcting codes and exhibiting their underlying topological orders via the Laurent polynomial ring. This framework naturally applies to bivariate bicycle codes. For example, we construct optimal weight-6 generalized toric codes on twisted tori with parameters [ [ n , k , d ] ] for n ≤ 400 , yielding novel codes such as [ [ 120 , 8 , 12 ] ] , [ [ 186 , 10 , 14 ] ] , [ [ 210 , 10 , 16 ] ] , [ [ 248 , 10 , 18 ] ] , [ [ 254 , 14 , 16 ] ] , [ [ 294 , 10 , 20 ] ] , [ [ 310 , 10 , ≤ 22 ] ] , and [ [ 340 , 16 , 18 ] ] . Moreover, we present a new realization of the [ [ 360 , 12 , ≤ 24 ] ] quantum code using the ( 3 , 3 ) -bivariate bicycle code on a twisted torus defined by the basis vectors ( 0 , 30 ) and ( 6 , 6 ) , improving stabilizer locality relative to the previous construction. These results highlight the power of the topological order perspective in advancing the design and theoretical understanding of quantum low-density parity-check (LDPC) codes.The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads. In this work, we introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions, enabling the exploration of generalized toric codes with larger logical dimensions on twisted tori. Using Gröbner bases, we simplify stabilizer syndromes to efficiently identify anyon excitations and their geometric periodicities, even under twisted periodic boundary conditions. Since the properties of the codes are determined by the anyons, this approach allows us to directly compute the logical dimensions without constructing large parity-check matrices. Our approach provides a unified method for finding new quantum error-correcting codes and exhibiting their underlying topological orders via the Laurent polynomial ring. This framework naturally applies to bivariate bicycle codes. For example, we construct optimal weight-6 generalized toric codes on twisted tori with parameters [ [ n , k , d ] ] for n ≤ 400 , yielding novel codes such as [ [ 120 , 8 , 12 ] ] , [ [ 186 , 10 , 14 ] ] , [ [ 210 , 10 , 16 ] ] , [ [ 248 , 10 , 18 ] ] , [ [ 254 , 14 , 16 ] ] , [ [ 294 , 10 , 20 ] ] , [ [ 310 , 10 , ≤ 22 ] ] , and [ [ 340 , 16 , 18 ] ] . Moreover, we present a new realization of the [ [ 360 , 12 , ≤ 24 ] ] quantum code using the ( 3 , 3 ) -bivariate bicycle code on a twisted torus defined by the basis vectors ( 0 , 30 ) and ( 6 , 6 ) , improving stabilizer locality relative to the previous construction. These results highlight the power of the topological order perspective in advancing the design and theoretical understanding of quantum low-density parity-check (LDPC) codes.

arXiv:2503.03827PRX QuantumMay 13, 20258 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.comFINDING: 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, 20260 citations

Topological Ordering in the Majorana Toric Code

Ananda Roy, Alexander Ziesen, Fabian Hassler

Bulletin of the American Physical SocietyMar 5, 20190 citations

Anyon Theory and Topological Frustration of High-Efficiency Quantum Low-Density Parity-Check Codes

Keyang Chen, Yuanting Liu, Yiming Zhang +4 more

Quantum low-density parity-check (QLDPC) codes offer a promising path to low-overhead fault-tolerant quantum computation but lack systematic strategies for exploration. In this Letter, we establish a topological framework for studying the bivariate-bicycle codes, a prominent class of QLDPC codes tailored for real-world quantum hardware. Our framework enables the investigation of these codes through universal properties of topological orders. In addition to efficient characterizations using Gröbner bases, we also introduce a novel algebraic-geometric approach based on the Bernstein-Khovanskii-Kushnirenko theorem. This approach allows us to analytically determine how the topological order varies with the generic choices of bivariate-bicycle codes under toric layouts. Novel phenomena are unveiled, including topological frustration, where ground-state degeneracy on a torus deviates from the total anyon number, and quasifractonic mobility, where anyon movement violates energy conservation. We demonstrate their intrinsic link to symmetry-enriched topological orders and derive an efficient method for generating finite-size codes. Furthermore, we extend the connection between anyons and logical operators using Koszul complex theory. Our Letter provides a rigorous theoretical basis for exploring the fault tolerance of QLDPC codes and deepens the interplay among topological order, quantum error correction, and advanced algebraic structures.Quantum low-density parity-check (QLDPC) codes offer a promising path to low-overhead fault-tolerant quantum computation but lack systematic strategies for exploration. In this Letter, we establish a topological framework for studying the bivariate-bicycle codes, a prominent class of QLDPC codes tailored for real-world quantum hardware. Our framework enables the investigation of these codes through universal properties of topological orders. In addition to efficient characterizations using Gröbner bases, we also introduce a novel algebraic-geometric approach based on the Bernstein-Khovanskii-Kushnirenko theorem. This approach allows us to analytically determine how the topological order varies with the generic choices of bivariate-bicycle codes under toric layouts. Novel phenomena are unveiled, including topological frustration, where ground-state degeneracy on a torus deviates from the total anyon number, and quasifractonic mobility, where anyon movement violates energy conservation. We demonstrate their intrinsic link to symmetry-enriched topological orders and derive an efficient method for generating finite-size codes. Furthermore, we extend the connection between anyons and logical operators using Koszul complex theory. Our Letter provides a rigorous theoretical basis for exploring the fault tolerance of QLDPC codes and deepens the interplay among topological order, quantum error correction, and advanced algebraic structures.

arXiv:2503.04699Physical Review LettersJun 26, 20258 citations

Quantum Codes for Topological Quantum Computation

Clarice Dias de Albuquerque, Eduardo Brandani da Silva, Waldir Silva Soares

SpringerBriefs in mathematicsJan 1, 20223 citations

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