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

Oxford University Press eBooks

Quantum error correction

Isaac L. Chuang

Published Jun 12, 2014• 25 citations
Publisher

Abstract

Abstract This chapter treats the subject of quantum error correction and fault-tolerant quantum computation. In particular, it presents the various representations of open-system quantum dynamics, insisting on the indistinguishability between different unravelings. Quantum error correction with discrete gates reacting to discrete error syndromes obtained from projective measurement can be seen as a form of quantum feedback that stabilizes a whole manifold of quantum states rather than a single one. The chapter gives a useful general introduction to the theory of stabilizers, which is key to the understanding of error correcting codes. It explains in full detail the principles behind the size of the overhead needed to make the entire quantum processor fault-tolerant, not just its memory.

DOI
10.1093/acprof:oso/9780199681181.003.0007

Related papers

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

Quantum error correction and fault tolerance

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

Quantum computing has the capability to the solution of complex problems that classical systems are incapable of solving, but its practical application is crippled by the instability of quantum states. Trying to do quantum computations with quantum bits (qubits) is prone to decoherence, operational errors, and environmental noise, which can quickly lower computational accuracy. In this chapter, we discuss these issues by studying the theoretical basis and experimental techniques of the quantum error correction and fault-tolerant quantum computing. The key issue that has been recognized is the faithful storage and interaction of quantum information regardless of the fallible hardware and flawed hardware control systems. The aim of this chapter is to get a clear exposition of the principles of leading error correction codes, their implementation strategies, and the fault tolerance criteria. It also talks about threshold theorems, resource overheads and architectural considerations required to make quantum computation scalable. Through theoretical constructs as well as the latest advances, this chapter culminates on the idea that though the fault tolerance is still a resource intensive process in nature, it is theoretically plausible only within a certain limit of error margin. The most notable point is that the progress of quantum error correction and fault-tolerant quantum computing is used to design future quantum architectures that can transform the barriers of experiments to the needs of large-scale and reliable quantum computing.

CRC Press eBooks•Nov 6, 2026•0 citations

An introduction to quantum error correction and fault-tolerant quantum computation

Daniel Gottesman

Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers.The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes.Many quantum codes can be described in terms of the stabilizer of the codewords.The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code.The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements.To build a quantum computer which behaves correctly in the presence of errors, we also need a theory of fault-tolerant quantum computation, instructing us how to perform quantum gates on qubits which are encoded in a quantum errorcorrecting code.The threshold theorem states that it is possible to create a quantum computer to perform an arbitrary quantum computation provided the error rate per physical gate or time step is below some constant threshold value.

arXiv:0904.2557•Proceedings of symposia in applied mathematics•Jan 1, 2010•798 citations

Aspects of Fault-Tolerant Quantum Computation

Joseph K. Iverson

This thesis is concerned with fault-tolerant quantum information processing using quantum error-correcting codes. It contains two major pieces of work. The first is a study of coherent noise in the context of stabilizer error-correcting codes. The second is a proposed scheme for a universal set of fault-tolerant logical gates in a particular code family built out of the 3D toric code. Chapter 1 provides an introduction to quantum computation and fault tolerance. Many basic concepts in error-correcting codes are defined. Special attention is paid to the set of code properties that are most likely to determine how easily a given fault-tolerant scheme might be implemented on a physical device. These include the fault-tolerant noise threshold and the overhead. In Chapters 2 and 3 we study the effectiveness of quantum error correction against coherent noise. Coherent errors (for example, unitary noise) can interfere constructively, so that in some cases the average infidelity of a quantum circuit subjected to coherent errors may increase quadratically with the circuit size; in contrast, when errors are incoherent (for example, depolarizing noise), the average infidelity increases at worst linearly with circuit size. We consider the performance of quantum stabilizer codes against a noise model in which a unitary rotation is applied to each qubit, where the axes and angles of rotation are nearly the same for all qubits. In Chapter 2 we introduce coherent noise and incoherent noise and a number of methods that are useful for the study of coherent noise. We study the repetition code as a basic example, and we also study a correlated noise model. In Chapter 3 we show that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance. A similar conclusion holds for weakly correlated coherent noise. Our methods can also be used for analyzing the performance of other codes and fault-tolerant protocols against coherent noise. However, our result does not show that the coherence of the logical channel is suppressed in the more physically relevant case where the noise strength is held constant as the code block grows, and we recount the difficulties that prevented us from extending the result to that case. Nevertheless our work supports the idea that fault-tolerant quantum computing schemes will work effectively against coherent noise, providing encouraging news for quantum hardware builders who worry about the damaging effects of control errors and coherent interactions with the environment. Chapter 4 is connected to another aspect of fault tolerance, fault-tolerant logical gates. The toric code is a promising candidate for fault-tolerant quantum computation because of its high threshold and low-weight stabilizers. A universal gate set in the toric code generally requires magic state distillation, which can incur a significant qubit overhead. In this work we construct an error-correcting code in three dimensions based on the toric code that features a fault-tolerant T gate with no magic state distillation required. We further describe a subsystem version of our code which supports a universal set of fault-tolerant gates. This code can be converted into the stabilizer version using gauge-fixing. We also argue that our code can be converted to a (2+1)-D protocol, where a 2D lattice undergoes a measurement-based protocol over time. In this way, a fault-tolerant logical T gate can be realized in a 2D toric code structure.

•Jun 1, 2020•2 citations

Key ideas in quantum error correction

Robert Raussendorf

In this introductory article on the subject of quantum error correction and fault-tolerant quantum computation, we review three important ingredients that enter known constructions for fault-tolerant quantum computation, namely quantum codes, error discretization and transversal quantum gates. Taken together, they provide a ground on which the theory of quantum error correction can be developed and fault-tolerant quantum information protocols can be built.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Aug 20, 2012•57 citations

Extending Quantum Error Correction: New Continuous Measurement Protocols and Improved Fault-Tolerant Overhead

Charlene Ahn

Quantum mechanical applications range from quantum computers to quantum key distribution to teleportation. In these applications, quantum error correction is extremely important for protecting quantum states against decoherence. Here I present two main results regarding quantum error correction protocols. The first main topic I address is the development of continuous-time quantum error correction protocols via combination with techniques from quantum control. These protocols rely on weak measurement and Hamiltonian feedback instead of the projective measurements and unitary gates usually assumed by canonical quantum error correction. I show that a subclass of these protocols can be understood as a quantum feedback protocol, and analytically analyze the general case using the stabilizer formalism; I show that in this case perfect feedback can perfectly protect a stabilizer subspace. I also show through numerical simulations that another subclass of these protocols does better than canonical quantum error correction when the time between corrections is limited. The second main topic is development of improved overhead results for fault-tolerant computation. In particular, through analysis of topological quantum error correcting codes, it will be shown that the required blowup in depth of a noisy circuit performing a fault-tolerant computation can be reduced to a factor of O(log log L), an improvement over previous results. Showing this requires investigation into a local method of performing fault-tolerant correction on a topological code of arbitrary dimension.

•May 20, 2004•10 citations
Abstract This chapter treats the subject of quantum error correction and fault-tolerant quantum computation. In particular, it presents the various representations of open-system quantum dynamics, insisting on the indistinguishability between different unravelings. Quantum error correction with discrete gates reacting to discrete error syndromes obtained from projective measurement can be seen as a form of quantum feedback that stabilizes a whole manifold of quantum states rather than a single one. The chapter gives a useful general introduction to the theory of stabilizers, which is key to the understanding of error correcting codes. It explains in full detail the principles behind the size of the overhead needed to make the entire quantum processor fault-tolerant, not just its memory.
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 computing has the capability to the solution of complex problems that classical systems are incapable of solving, but its practical application is crippled by the instability of quantum states. Trying to do quantum computations with quantum bits (qubits) is prone to decoherence, operational errors, and environmental noise, which can quickly lower computational accuracy. In this chapter, we discuss these issues by studying the theoretical basis and experimental techniques of the quantum error correction and fault-tolerant quantum computing. The key issue that has been recognized is the faithful storage and interaction of quantum information regardless of the fallible hardware and flawed hardware control systems. The aim of this chapter is to get a clear exposition of the principles of leading error correction codes, their implementation strategies, and the fault tolerance criteria. It also talks about threshold theorems, resource overheads and architectural considerations required to make quantum computation scalable. Through theoretical constructs as well as the latest advances, this chapter culminates on the idea that though the fault tolerance is still a resource intensive process in nature, it is theoretically plausible only within a certain limit of error margin. The most notable point is that the progress of quantum error correction and fault-tolerant quantum computing is used to design future quantum architectures that can transform the barriers of experiments to the needs of large-scale and reliable quantum computing.
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers.The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes.Many quantum codes can be described in terms of the stabilizer of the codewords.The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code.The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements.To build a quantum computer which behaves correctly in the presence of errors, we also need a theory of fault-tolerant quantum computation, instructing us how to perform quantum gates on qubits which are encoded in a quantum errorcorrecting code.The threshold theorem states that it is possible to create a quantum computer to perform an arbitrary quantum computation provided the error rate per physical gate or time step is below some constant threshold value.
This thesis is concerned with fault-tolerant quantum information processing using quantum error-correcting codes. It contains two major pieces of work. The first is a study of coherent noise in the context of stabilizer error-correcting codes. The second is a proposed scheme for a universal set of fault-tolerant logical gates in a particular code family built out of the 3D toric code. Chapter 1 provides an introduction to quantum computation and fault tolerance. Many basic concepts in error-correcting codes are defined. Special attention is paid to the set of code properties that are most likely to determine how easily a given fault-tolerant scheme might be implemented on a physical device. These include the fault-tolerant noise threshold and the overhead. In Chapters 2 and 3 we study the effectiveness of quantum error correction against coherent noise. Coherent errors (for example, unitary noise) can interfere constructively, so that in some cases the average infidelity of a quantum circuit subjected to coherent errors may increase quadratically with the circuit size; in contrast, when errors are incoherent (for example, depolarizing noise), the average infidelity increases at worst linearly with circuit size. We consider the performance of quantum stabilizer codes against a noise model in which a unitary rotation is applied to each qubit, where the axes and angles of rotation are nearly the same for all qubits. In Chapter 2 we introduce coherent noise and incoherent noise and a number of methods that are useful for the study of coherent noise. We study the repetition code as a basic example, and we also study a correlated noise model. In Chapter 3 we show that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance. A similar conclusion holds for weakly correlated coherent noise. Our methods can also be used for analyzing the performance of other codes and fault-tolerant protocols against coherent noise. However, our result does not show that the coherence of the logical channel is suppressed in the more physically relevant case where the noise strength is held constant as the code block grows, and we recount the difficulties that prevented us from extending the result to that case. Nevertheless our work supports the idea that fault-tolerant quantum computing schemes will work effectively against coherent noise, providing encouraging news for quantum hardware builders who worry about the damaging effects of control errors and coherent interactions with the environment. Chapter 4 is connected to another aspect of fault tolerance, fault-tolerant logical gates. The toric code is a promising candidate for fault-tolerant quantum computation because of its high threshold and low-weight stabilizers. A universal gate set in the toric code generally requires magic state distillation, which can incur a significant qubit overhead. In this work we construct an error-correcting code in three dimensions based on the toric code that features a fault-tolerant T gate with no magic state distillation required. We further describe a subsystem version of our code which supports a universal set of fault-tolerant gates. This code can be converted into the stabilizer version using gauge-fixing. We also argue that our code can be converted to a (2+1)-D protocol, where a 2D lattice undergoes a measurement-based protocol over time. In this way, a fault-tolerant logical T gate can be realized in a 2D toric code structure.
Quantum mechanical applications range from quantum computers to quantum key distribution to teleportation. In these applications, quantum error correction is extremely important for protecting quantum states against decoherence. Here I present two main results regarding quantum error correction protocols. The first main topic I address is the development of continuous-time quantum error correction protocols via combination with techniques from quantum control. These protocols rely on weak measurement and Hamiltonian feedback instead of the projective measurements and unitary gates usually assumed by canonical quantum error correction. I show that a subclass of these protocols can be understood as a quantum feedback protocol, and analytically analyze the general case using the stabilizer formalism; I show that in this case perfect feedback can perfectly protect a stabilizer subspace. I also show through numerical simulations that another subclass of these protocols does better than canonical quantum error correction when the time between corrections is limited. The second main topic is development of improved overhead results for fault-tolerant computation. In particular, through analysis of topological quantum error correcting codes, it will be shown that the required blowup in depth of a noisy circuit performing a fault-tolerant computation can be reduced to a factor of O(log log L), an improvement over previous results. Showing this requires investigation into a local method of performing fault-tolerant correction on a topological code of arbitrary dimension.