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

Science

Error-Correcting Code Keeps Quantum Computers on Track

Barry A. Cipra

Published Apr 12, 1996• 4 citations
Publisher

Abstract

Quantum computers, which could exploit systems such as the energy states of a row of atoms to perform vast numbers of computations at the same time, have remained in the realm of fantasy. A major barrier has been the fragility of quantum states, which makes quantum systems vulnerable to errors. Classical error-correction schemes won't work in a quantum computer, because they rely on duplicate bits, and in quantum systems information vanishes when you read and copy it. A new mathematical scheme, however, makes it possible—at least in theory—to nudge a quantum system back into line without directly looking at it. Computers/Math

DOI
10.1126/science.272.5259.199

Related papers

Quantum Error Correction

Phillip Kaye, Raymond Laflamme, Michele Mosca

A mathematical model of computation is an idealized abstraction. We design algorithms and perform analysis on the assumption that the mathematical operations we specify will be carried out exactly, and without error. Physical devices that implement an abstract model of computation are imperfect and of limited precision. For example, when a digital circuit is implemented on a physical circuit board, unwanted electrical noise in the environment may cause components to behave differently than expected, and may cause voltage levels (bit-values) to change. These sources of error must be controlled or compensated for, or else the resulting loss of efficiency may reduce the power of the information-processing device. If individual steps in a computation succeed with probability p, then a computation involving t sequential steps will have a success probability that decreases exponentially as pt. Although it may be impossible to eliminate the sources of errors, we can devise schemes to allow us to recover from errors using a reasonable amount of additional resources. Many classical digital computing devices use error-correcting codes to perform detection of and recovery from errors. The theory of error-correcting codes is itself a mathematical abstraction, but it is one that explicitly accounts for errors introduced by the imperfection and imprecision of realistic devices. This theory has proven extremely effective in allowing engineers to build computing devices that are resilient against errors. Quantum computers are more susceptible to errors than classical digital computers, because quantum mechanical systems are more delicate and more difficult to control. If large-scale quantum computers are to be possible, a theory of quantum error correction is needed. The discovery of quantum error correction has given researchers confidence that realistic large-scale quantum computing devices can be built despite the presence of errors. We begin by considering fundamental concepts for error correction in a classical setting. We will focus on three of these concepts: (a) the characterization of the error model, (b) the introduction of redundancy through encoding, and (c) an error recovery procedure. We will later see that these concepts generalize quite naturally for quantum error correction.

Oxford University Press eBooks•Nov 16, 2006•0 citations

QUANTUM ERROR CORRECTION AND STABILIZER CODES

Artur Elezi

The goal of this paper is to provide a self contained detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes without venturing much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs - quite a few of of them new - that we present here. The connections between (a) quantum stabilizer codes and classical self-orthogonal codes and (b) between error correction and error detection have been established in details. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed here.

International Journal of Pure and Apllied Mathematics•Jan 1, 2015•0 citations

Quantum error correction and fault tolerance: A comprehensive tutorial

Daniel J. Spencer, Shubham P. Jain, Andrew Tanggara +4 more

Noise is one of the central obstacles to building useful quantum computers, and quantum error correction (QEC) provides the framework for protecting quantum information against it. Unlike classical error correction, QEC must preserve fragile quantum states without copying them, measuring them directly, or destroying the information they encode. Driven by rapid progress in both theory and experiment, this challenge has grown into one of the most active areas of quantum information science. This tutorial gives a guided introduction to modern QEC, developing the core concepts of codes, syndromes, stabilizers, decoding, and fault tolerance before connecting them to major code families and current research directions. We cover both established constructions and newer developments, including topological and subsystem codes, bosonic and qudit codes, dynamical codes, and quantum low-density parity-check (qLDPC) codes. The emphasis is on building operational understanding: explaining not only what the main objects are, but how they are used in code design, error diagnosis, decoding, and fault-tolerant computation. The tutorial is intended for newcomers seeking a first path through QEC, as well as researchers looking for a coherent reference for the concepts, code families, and tools that arise in current work.

quant-pharXiv:2605.29137•May 29, 2026•7 citations

New methods in quantum error correction and fault-tolerant quantum computing

Christopher Chamberland

Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.

•Oct 22, 2018•0 citations

Protecting quantum entanglement by repetitive measurement

Cornelis Christiaan Bultink

Information processing based on the laws of quantum mechanics promises to be a revolutionary new avenue in information technology. This emerging field of quantum information processing (QIP) is however challenged by the fragile nature of the quantum bits (qubits) in which quantum information is stored and processed. An error in even a single qubit makes the quantum processor go off-track, corrupting the calculation as a whole. Therefore, the chance for an erroneous outcome increases with the number of qubits in the processor. Large-scale QIP thus hinges on the ability to correct for these errors. Classical information processing often uses error correction algorithms to identify errors by checking whether information is consistent in multiple copies. This strategy is unfortunately not applicable to QIP as quantum states cannot be copied. Moreover, direct measurements on qubits collapse their quantum states, reducing them to classical information. Fortunately, the theory of quantum error correction (QEC) overcomes these complications by encoding quantum information in entangled states of many qubits and performing parity measurements to identify errors in the system without destroying the encoded information. Implementing these codes is challenging as it requires many qubits and quick interleaving of operations and measurements. Moreover, to not introduce more errors in the system than QEC can solve for, these operations and measurements need to be of sufficient fidelity and speed...

•Aug 24, 2020•1 citation

Haven for Quantum Computation

Their potential for solving difficult problems that classical computers cannot, and doing so more quickly, has generated much interest in the development of quantum computers. Just as a noisy environment can break our train of thought, the manipulation of a quantum state can result in its being disturbed or lost during interactions with its own environment—a process known as decoherence. Quantum error correction, in which code words placed in the message tell us how much the system has been distorted, works well for recovering the lost information but exacts a heavy computational cost.

Science•Sep 1, 2000•0 citations
Quantum computers, which could exploit systems such as the energy states of a row of atoms to perform vast numbers of computations at the same time, have remained in the realm of fantasy. A major barrier has been the fragility of quantum states, which makes quantum systems vulnerable to errors. Classical error-correction schemes won't work in a quantum computer, because they rely on duplicate bits, and in quantum systems information vanishes when you read and copy it. A new mathematical scheme, however, makes it possible—at least in theory—to nudge a quantum system back into line without directly looking at it. Computers/Math
A mathematical model of computation is an idealized abstraction. We design algorithms and perform analysis on the assumption that the mathematical operations we specify will be carried out exactly, and without error. Physical devices that implement an abstract model of computation are imperfect and of limited precision. For example, when a digital circuit is implemented on a physical circuit board, unwanted electrical noise in the environment may cause components to behave differently than expected, and may cause voltage levels (bit-values) to change. These sources of error must be controlled or compensated for, or else the resulting loss of efficiency may reduce the power of the information-processing device. If individual steps in a computation succeed with probability p, then a computation involving t sequential steps will have a success probability that decreases exponentially as pt. Although it may be impossible to eliminate the sources of errors, we can devise schemes to allow us to recover from errors using a reasonable amount of additional resources. Many classical digital computing devices use error-correcting codes to perform detection of and recovery from errors. The theory of error-correcting codes is itself a mathematical abstraction, but it is one that explicitly accounts for errors introduced by the imperfection and imprecision of realistic devices. This theory has proven extremely effective in allowing engineers to build computing devices that are resilient against errors. Quantum computers are more susceptible to errors than classical digital computers, because quantum mechanical systems are more delicate and more difficult to control. If large-scale quantum computers are to be possible, a theory of quantum error correction is needed. The discovery of quantum error correction has given researchers confidence that realistic large-scale quantum computing devices can be built despite the presence of errors. We begin by considering fundamental concepts for error correction in a classical setting. We will focus on three of these concepts: (a) the characterization of the error model, (b) the introduction of redundancy through encoding, and (c) an error recovery procedure. We will later see that these concepts generalize quite naturally for quantum error correction.
The goal of this paper is to provide a self contained detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes without venturing much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs - quite a few of of them new - that we present here. The connections between (a) quantum stabilizer codes and classical self-orthogonal codes and (b) between error correction and error detection have been established in details. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed here.
Noise is one of the central obstacles to building useful quantum computers, and quantum error correction (QEC) provides the framework for protecting quantum information against it. Unlike classical error correction, QEC must preserve fragile quantum states without copying them, measuring them directly, or destroying the information they encode. Driven by rapid progress in both theory and experiment, this challenge has grown into one of the most active areas of quantum information science. This tutorial gives a guided introduction to modern QEC, developing the core concepts of codes, syndromes, stabilizers, decoding, and fault tolerance before connecting them to major code families and current research directions. We cover both established constructions and newer developments, including topological and subsystem codes, bosonic and qudit codes, dynamical codes, and quantum low-density parity-check (qLDPC) codes. The emphasis is on building operational understanding: explaining not only what the main objects are, but how they are used in code design, error diagnosis, decoding, and fault-tolerant computation. The tutorial is intended for newcomers seeking a first path through QEC, as well as researchers looking for a coherent reference for the concepts, code families, and tools that arise in current work.
Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.
Information processing based on the laws of quantum mechanics promises to be a revolutionary new avenue in information technology. This emerging field of quantum information processing (QIP) is however challenged by the fragile nature of the quantum bits (qubits) in which quantum information is stored and processed. An error in even a single qubit makes the quantum processor go off-track, corrupting the calculation as a whole. Therefore, the chance for an erroneous outcome increases with the number of qubits in the processor. Large-scale QIP thus hinges on the ability to correct for these errors. Classical information processing often uses error correction algorithms to identify errors by checking whether information is consistent in multiple copies. This strategy is unfortunately not applicable to QIP as quantum states cannot be copied. Moreover, direct measurements on qubits collapse their quantum states, reducing them to classical information. Fortunately, the theory of quantum error correction (QEC) overcomes these complications by encoding quantum information in entangled states of many qubits and performing parity measurements to identify errors in the system without destroying the encoded information. Implementing these codes is challenging as it requires many qubits and quick interleaving of operations and measurements. Moreover, to not introduce more errors in the system than QEC can solve for, these operations and measurements need to be of sufficient fidelity and speed...
Their potential for solving difficult problems that classical computers cannot, and doing so more quickly, has generated much interest in the development of quantum computers. Just as a noisy environment can break our train of thought, the manipulation of a quantum state can result in its being disturbed or lost during interactions with its own environment—a process known as decoherence. Quantum error correction, in which code words placed in the message tell us how much the system has been distorted, works well for recovering the lost information but exacts a heavy computational cost.