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:1603.08729 · Physical Review A

Error tolerance of topological codes with independent bit-flip and measurement errors

Ruben S. Andrist, Helmut G. Katzgraber, Héctor Bombín, Miguel Angel Martin-Delgado

Published Jul 12, 2016• 20 citations
arXivHTMLPDF

Abstract

Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be calculated by mapping the underlying quantum problem to a related classical statistical-mechanical spin system with quenched disorder. Here, we present results for the general fault-tolerant regime, where we consider both qubit and measurement errors. However, unlike in previous studies, here we vary the strength of the different error sources independently. Our results highlight peculiar differences between toric and color codes. This study complements previous results published in New J. Phys. 13, 083006 (2011).

DOI
10.1103/physreva.94.012318

Related papers

The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault-Tolerant Quantum Computation and Quantum Phases Of Matter

Aleksander Kubica

This thesis is devoted to studying a class of quantum error-correcting codes — topological quantum codes. We explore the question of how one can achieve fault- tolerant quantum computation with topological codes. We treat quantum error-correcting codes not only as a compelling ingredient needed to build a quantum computer, but also as a useful theoretical tool in other areas of physics. In particular, we explore what insights topological codes can provide into challenging questions, such as the classification of quantum phases of matter. In this thesis, we focus on a family of topological codes — color codes, which are particularly intriguing due to the rich physics they display and their computational power. We start by introducing color codes and explaining their basic properties. Then, we show how to perform fault-tolerant universal quantum computation with three-dimensional color codes by transverse gates and code switching. We later compare the resource overhead of the code-switching approach with that of a state distillation scheme. We discuss how to perform error correction with the toric and color codes, as well as introduce local decoders for those two families of codes. By exploiting a connection between error correction and statistical mechanics we estimate the storage threshold error rates for bit-flip and phase-flip noise in the three-dimensional color code. We finish by showing that the color and toric code families in d dimensions are equivalent in a sense of local unitary transformations and explore implications of this equivalence.

•May 29, 2018•28 citations

Efficient fault-tolerant decoding of topological color codes

Ashley M. Stephens

Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum computation. Recently, several efficient algorithms for decoding the syndrome of color codes were proposed. Here, we modify one of these algorithms to account for errors affecting the syndrome, applying it to the family of triangular 4.8.8 color codes encoding one logical qubit. For a three-dimensional bit-flip channel, we report a threshold error rate of 0.0208(1), compared with 0.0305(4) previously reported for an integer-program-based decoding algorithm. When we account for circuit details, this threshold is reduced to 0.00143(1) per gate, compared with 0.00672(1) per gate for the surface code under an identical noise model.

arXiv:1402.3037•Feb 13, 2014•15 citations

Optimal error correction in topological subsystem codes

Ruben S. Andrist, Héctor Bombín, Helmut G. Katzgraber +1 more

A promising approach to overcome decoherence in quantum computing schemes is to perform active quantum error correction using topology. Topological subsystem codes incorporate both the benefits of topological and subsystem codes, allowing for error syndrome recovery with only 2-local measurements in a two-dimensional array of qubits. We study the error threshold for topological subsystem color codes under very general external noise conditions. By transforming the problem into a classical disordered spin model, we estimate using Monte Carlo simulations that topological subsystem codes have an optimal error tolerance of $5.5(2)%$. This means there is ample space for improvement in existing error-correcting algorithms that typically find a threshold of approximately $2%$.

arXiv:1204.1838•Physical Review A•May 14, 2012•23 citations

Ising on the donut: Regimes of topological quantum error correction from statistical mechanics

Lucas H. English, Sam Roberts, Stephen D. Bartlett +2 more

Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analysing QEC performance. However, predicting the behaviour of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly-solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansatze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.

quant-pharXiv:2512.10399•PRX Quantum•Dec 12, 2025•0 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•0 citations

Efficient decoding of topological color codes

Pradeep Kiran Sarvepalli, Robert Raussendorf

Color codes are a class of topological quantum codes with a high error threshold and a large set of transversal encoded gates and are thus suitable for fault-tolerant quantum computation in two-dimensional architectures. Recently, computationally efficient decoders for the color codes were proposed. We describe an alternate efficient iterative decoder for topological color codes and apply it to the color code on the hexagonal lattice embedded on a torus. In numerical simulations, we find an error threshold of 7.8$%$ for independent dephasing and spin-flip errors.

arXiv:1111.0831•Physical Review A•Feb 13, 2012•51 citations
Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be calculated by mapping the underlying quantum problem to a related classical statistical-mechanical spin system with quenched disorder. Here, we present results for the general fault-tolerant regime, where we consider both qubit and measurement errors. However, unlike in previous studies, here we vary the strength of the different error sources independently. Our results highlight peculiar differences between toric and color codes. This study complements previous results published in New J. Phys. 13, 083006 (2011).
This thesis is devoted to studying a class of quantum error-correcting codes — topological quantum codes. We explore the question of how one can achieve fault- tolerant quantum computation with topological codes. We treat quantum error-correcting codes not only as a compelling ingredient needed to build a quantum computer, but also as a useful theoretical tool in other areas of physics. In particular, we explore what insights topological codes can provide into challenging questions, such as the classification of quantum phases of matter. In this thesis, we focus on a family of topological codes — color codes, which are particularly intriguing due to the rich physics they display and their computational power. We start by introducing color codes and explaining their basic properties. Then, we show how to perform fault-tolerant universal quantum computation with three-dimensional color codes by transverse gates and code switching. We later compare the resource overhead of the code-switching approach with that of a state distillation scheme. We discuss how to perform error correction with the toric and color codes, as well as introduce local decoders for those two families of codes. By exploiting a connection between error correction and statistical mechanics we estimate the storage threshold error rates for bit-flip and phase-flip noise in the three-dimensional color code. We finish by showing that the color and toric code families in d dimensions are equivalent in a sense of local unitary transformations and explore implications of this equivalence.
Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum computation. Recently, several efficient algorithms for decoding the syndrome of color codes were proposed. Here, we modify one of these algorithms to account for errors affecting the syndrome, applying it to the family of triangular 4.8.8 color codes encoding one logical qubit. For a three-dimensional bit-flip channel, we report a threshold error rate of 0.0208(1), compared with 0.0305(4) previously reported for an integer-program-based decoding algorithm. When we account for circuit details, this threshold is reduced to 0.00143(1) per gate, compared with 0.00672(1) per gate for the surface code under an identical noise model.
A promising approach to overcome decoherence in quantum computing schemes is to perform active quantum error correction using topology. Topological subsystem codes incorporate both the benefits of topological and subsystem codes, allowing for error syndrome recovery with only 2-local measurements in a two-dimensional array of qubits. We study the error threshold for topological subsystem color codes under very general external noise conditions. By transforming the problem into a classical disordered spin model, we estimate using Monte Carlo simulations that topological subsystem codes have an optimal error tolerance of 5.5(2)5.5(2)%5.5(2). This means there is ample space for improvement in existing error-correcting algorithms that typically find a threshold of approximately 22%2.
Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analysing QEC performance. However, predicting the behaviour of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly-solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansatze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.
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.
Color codes are a class of topological quantum codes with a high error threshold and a large set of transversal encoded gates and are thus suitable for fault-tolerant quantum computation in two-dimensional architectures. Recently, computationally efficient decoders for the color codes were proposed. We describe an alternate efficient iterative decoder for topological color codes and apply it to the color code on the hexagonal lattice embedded on a torus. In numerical simulations, we find an error threshold of 7.8% for independent dephasing and spin-flip errors.