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:1312.5213 · New Journal of Physics

Logical error rate scaling of the toric code

Fern H. E. Watson, S. D. Barrett

Published Sep 25, 2014• 31 citations
arXivHTMLPDF

Abstract

To date, a great deal of attention has focused on characterizing the performance of quantum error correcting codes via their thresholds, the maximum correctable physical error rate for a given noise model and decoding strategy. Practical quantum computers will necessarily operate below these thresholds meaning that other performance indicators become important. In this work we consider the scaling of the logical error rate of the toric code and demonstrate how, in turn, this may be used to calculate a key performance indicator. We use a perfect matching decoding algorithm to find the scaling of the logical error rate and find two distinct operating regimes. The first regime admits a universal scaling analysis due to a mapping to a statistical physics model. The second regime characterizes the behaviour in the limit of small physical error rate and can be understood by counting the error configurations leading to the failure of the decoder. We present a conjecture for the ranges of validity of these two regimes and use them to quantify the overhead—the total number of physical qubits required to perform error correction.

DOI
10.1088/1367-2630/16/9/093045

Related papers

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•8 citations

Quantum error correction with the toric code

Atom Computing, Collaborators

Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly advancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstration of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.

quant-pharXiv:2606.04079•Jun 3, 2026•24 citations

Homological quantum codes beyond the toric code

Nikolas P. Breuckmann

Computer architectures which exploit quantum mechanical effects can solve computing tasks that are otherwise impossible to perform. A quantum computer operates on a number of small quantum mechanical systems, known as quantum bits, or qubits. Since these systems are realized on the scale of atoms, they are very prone to errors. Errors occur when the environment interacts with the qubits, a process called decoherence. It is widely accepted that it will not be possible to shield qubits completely from the outside world. If one were to perform a quantum computation on the qubits directly, then after a short period of time the information present in the qubits would be lost. To counter decoherence the state of a qubit can be encoded into multiple physical ones. This is called a quantum error correcting code. Performing quantum error correction allows one to extend the life time of the encoded qubit arbitrarily, assuming that the rate of errors remains below a certain threshold value. The use of quantum codes creates an overhead in resources, as for every logical qubit many more physical qubits are needed. The resource overhead for fault-tolerance is problematic, since realizing qubits will be costly, and in the early stages of building quantum computers the number of physical qubits will be limited. The currently favored coding architecture is the toric code and its variant the surface code in which the physical qubits are put on a square grid in which interactions are only between nearest neighbors. In this thesis we will explore quantum codes in which qubits interact as if they were nearest neighbors in more exotic spaces. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude. We also show how to read and write the encoded qubits while keeping their connectivity low. In the second part we consider codes in which qubits are layed-out according to a four- dimensional geometry. Such codes allow for much simpler decoding schemes compared to codes which are two-dimensional. In particular, measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified. We perform numerical simulations to analyze the performance of these codes using decoders based on local updates. We also introduce a novel decoder based on techniques from machine learning and image recognition to decode four-dimensional codes.

•Jan 1, 2017•13 citations

Quantum error correction with the toric code

Matthew A. Norcia, David Aasen, Stephen Armstrong +97 more

Abstract Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly ad- vancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstra- tion of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.

•Jun 15, 2026•0 citations

Performance of topological codes for quantum error correction

Fern H. E. Watson

In this thesis we present three main contributions to the field of topological quantum error correcting codes. We focus on some of the properties of such codes required for fault-tolerant quantum computation. Prior work has concentrated on determining error rate thresholds of particular models, but increasingly other parameters are gaining prominence. One of these is the overhead -- the quantity of a named resource required to achieve a desired level of performance from the code. We characterise the qubit overhead of the toric code in a fault-tolerant setting. These results provide a general framework for determining the overhead for other code constructions with more complicated noise models. Next we introduce a decoding algorithm, applicable to topological codes in a qudit architecture, specifically those where fault-tolerance is achieved through repeated syndrome measurements. It is computationally light and capable of decoding qudits of arbitrarily high dimension with negligible increase in its run time. The threshold of the decoder is limited by the percolation of the syndromes. Using local matching techniques we are able to overcome this limitation, increasing the threshold by almost a factor of two for high qudit dimensions. Finally, we turn our attention to a second family of topological quantum codes: the colour codes. In three and higher spatial dimensions such codes can support transversal non-Clifford gates. We show, using a technique that we call a star-bipartition of the vertices of the lattice, that any existing qubit colour code lattice can be used to define a qudit colour code. By generalising the notion of triorthogonal matrices we derive analogous transversality properties in the qudit codes.

•Jul 1, 2015•3 citations

Fault-tolerant hyperbolic Floquet quantum error correcting codes

Ali Fahimniya, Hossein Dehghani, Kishor Bharti +4 more

A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes.'' These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate ( 1 / 8 + 2 / n ) while still requiring only two-body measurements. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n . The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model and 0.25% in an entangling measurements noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [ [ 400 , 52 , 8 ] ] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.

arXiv:2309.10033•Quantum•Sep 5, 2025•34 citations
To date, a great deal of attention has focused on characterizing the performance of quantum error correcting codes via their thresholds, the maximum correctable physical error rate for a given noise model and decoding strategy. Practical quantum computers will necessarily operate below these thresholds meaning that other performance indicators become important. In this work we consider the scaling of the logical error rate of the toric code and demonstrate how, in turn, this may be used to calculate a key performance indicator. We use a perfect matching decoding algorithm to find the scaling of the logical error rate and find two distinct operating regimes. The first regime admits a universal scaling analysis due to a mapping to a statistical physics model. The second regime characterizes the behaviour in the limit of small physical error rate and can be understood by counting the error configurations leading to the failure of the decoder. We present a conjecture for the ranges of validity of these two regimes and use them to quantify the overhead—the total number of physical qubits required to perform error correction.
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.
Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly advancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstration of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.
Computer architectures which exploit quantum mechanical effects can solve computing tasks that are otherwise impossible to perform. A quantum computer operates on a number of small quantum mechanical systems, known as quantum bits, or qubits. Since these systems are realized on the scale of atoms, they are very prone to errors. Errors occur when the environment interacts with the qubits, a process called decoherence. It is widely accepted that it will not be possible to shield qubits completely from the outside world. If one were to perform a quantum computation on the qubits directly, then after a short period of time the information present in the qubits would be lost. To counter decoherence the state of a qubit can be encoded into multiple physical ones. This is called a quantum error correcting code. Performing quantum error correction allows one to extend the life time of the encoded qubit arbitrarily, assuming that the rate of errors remains below a certain threshold value. The use of quantum codes creates an overhead in resources, as for every logical qubit many more physical qubits are needed. The resource overhead for fault-tolerance is problematic, since realizing qubits will be costly, and in the early stages of building quantum computers the number of physical qubits will be limited. The currently favored coding architecture is the toric code and its variant the surface code in which the physical qubits are put on a square grid in which interactions are only between nearest neighbors. In this thesis we will explore quantum codes in which qubits interact as if they were nearest neighbors in more exotic spaces. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude. We also show how to read and write the encoded qubits while keeping their connectivity low. In the second part we consider codes in which qubits are layed-out according to a four- dimensional geometry. Such codes allow for much simpler decoding schemes compared to codes which are two-dimensional. In particular, measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified. We perform numerical simulations to analyze the performance of these codes using decoders based on local updates. We also introduce a novel decoder based on techniques from machine learning and image recognition to decode four-dimensional codes.
Abstract Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly ad- vancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstra- tion of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.
In this thesis we present three main contributions to the field of topological quantum error correcting codes. We focus on some of the properties of such codes required for fault-tolerant quantum computation. Prior work has concentrated on determining error rate thresholds of particular models, but increasingly other parameters are gaining prominence. One of these is the overhead -- the quantity of a named resource required to achieve a desired level of performance from the code. We characterise the qubit overhead of the toric code in a fault-tolerant setting. These results provide a general framework for determining the overhead for other code constructions with more complicated noise models. Next we introduce a decoding algorithm, applicable to topological codes in a qudit architecture, specifically those where fault-tolerance is achieved through repeated syndrome measurements. It is computationally light and capable of decoding qudits of arbitrarily high dimension with negligible increase in its run time. The threshold of the decoder is limited by the percolation of the syndromes. Using local matching techniques we are able to overcome this limitation, increasing the threshold by almost a factor of two for high qudit dimensions. Finally, we turn our attention to a second family of topological quantum codes: the colour codes. In three and higher spatial dimensions such codes can support transversal non-Clifford gates. We show, using a technique that we call a star-bipartition of the vertices of the lattice, that any existing qubit colour code lattice can be used to define a qudit colour code. By generalising the notion of triorthogonal matrices we derive analogous transversality properties in the qudit codes.
A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes.'' These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate ( 1 / 8 + 2 / n ) while still requiring only two-body measurements. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n . The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model and 0.25% in an entangling measurements noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [ [ 400 , 52 , 8 ] ] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.