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

CRC Press eBooks

Accuracy Threshold Theorem

Frank Gaitan

Published Feb 7, 2008• 0 citations
Publisher

Abstract

In this chapter we begin to examine quantum stabilizer codes in detail. Sec­ tion 3.1 introduces the theoretical framework that underlies this class of quan­ tum error correcting codes, and some examples are given in Section 3.2. Sec­ tion 3.3 shows how these codes can be described in terms of a binary vector space with symplectic inner product, and finally, concatenated quantum er­ ror correcting codes are introduced in Section 3.4. The latter discussion will focus on concatenated codes that are put together using quantum stabilizer codes. We will see in Chapter 6 that concatenated codes play an important role in establishing the accuracy threshold theorem for fault-tolerant quantum computing.

DOI
10.1201/b15868-7

Related papers

Quantum Mechanics

Frank Gaitan

In Chapters 2-5 we gave a detailed presentation of the theory of quantum error correction and fault-tolerant quantum computing. The stage is finally set for a proof of the accuracy threshold theorem [2-9]. As pointed out in Chapter 1, this theorem spells out the conditions under which quantum computing can be done reliably using imperfect quantum gates and in the presence of noise. The proof presented in this chapter follows Ref. [6]. Section 6.1 addresses a number of preliminary topics. It explains why a concatenated quantum error correcting code (QECC) should be used to protect the computational data when fault-tolerance is an issue; it states the principal assumptions underlying the threshold calculations presented in Section 6.2; and finally, it closes with a statement of the accuracy threshold theorem. The proof of this theorem is taken up in Section 6.2. For the error model introduced in Section 6.1, the accuracy threshold is calculated for gates in the Clifford group N(Qn), storage registers, and the Toffoli gate. The calculations make explicit use of the recursive structure of a concatenated QECC and the fault-tolerant procedures introduced in Chapter 5. The theorem is proved by showing that all three cases yield non-zero threshold values.

CRC Press eBooks•Feb 7, 2008•0 citations

Quantum Error Correction and Fault Tolerant Quantum Computing

Frank Gaitan

It was once widely believed that quantum computation would never become a reality. However, the discovery of quantum error correction and the proof of the accuracy threshold theorem nearly ten years ago gave rise to extensive development and research aimed at creating a working, scalable quantum computer. Over a decade has passed since this monumental accomplishment yet no book-length pedagogical presentation of this important theory exists. Quantum Error Correction and Fault Tolerant Quantum Computing offers the first full-length exposition on the realization of a theory once thought impossible. It provides in-depth coverage on the most important class of codes discovered to date—quantum stabilizer codes. It brings together the central themes of quantum error correction and fault-tolerant procedures to prove the accuracy threshold theorem for a particular noise error model. The author also includes a derivation of well-known bounds on the parameters of quantum error correcting code. Packed with over 40 real-world problems, 35 field exercises, and 17 worked-out examples, this book is the essential resource for any researcher interested in entering the quantum field as well as for those who want to understand how the unexpected realization of quantum computing is possible.

CRC Press eBooks•Dec 19, 2013•97 citations

Fault-tolerant computation without concatenation

Eric Dennis

It has been known that error-correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold (probably ∼ 10 −3 –10 −6). Other, un-concatenated codes with their own attractive features—e.g., an accuracy threshold ∼ 10 −2 —have also been studied. A method to obtain universal computation is presented here which does not rely on any concatenated structure within the code itself, but instead emulates this structure with logical qubits in order to construct an encoded Toffoli gate. This realizes ∼ 10 −2 as a threshold for fault-tolerant quantum computation. 1 QEC codes and universal computation In the “space ” of all possible quantum error-correcting codes, much recent work has focused on a relatively small class, namely concatenated codes [1]–[7]. The basic idea behind these is to improve the results of a given few-qubit code by

•May 7, 1999•2 citations

Group Theory

Frank Gaitan

The first theme of this book-quantum error correction-has now been pre­ sented. We carry on in this chapter with a discussion of fault-tolerant quantum computing (FTQC), which is our second theme. The discussion will take place in the context of quantum stabilizer codes and is based on Refs. [1-6]. See also Refs. [7,8]. Section 5.1 introduces the idea of fault-tolerance and makes ba­ sic definitions, while Section 5.2 presents a procedure for doing fault-tolerant quantum error correction. The theory of FTQC is then taken up in the fol­ lowing five sections. Section 5.3 examines the action of unitary operators on a quantum stabilizer code. It introduces two important groups: (i) the normalizer of the stabilizer S whose elements are encoded unitary operations; and (ii) the Clifford group which is generated by the Hadamard, phase, and CNOT gates. The discussion focuses on unitary operations that belong to the inter­ section of these two groups. By combining measurements on ancilla qubits (Section 5.4) with a four-qubit unitary operation introduced in Section 5.5, it will be possible to fault-tolerantly implement these gates on encoded data for stabilizer codes that encode a single qubit. Section 5.6 presents an extension of this approach that works for stabilizer codes encoding multiple qubits, and Section 5.7 completes the theoretical development by showing how a faulttolerant encoded Toffoli gate can be constructed for any quantum stabilizer code. By this point a theoretical framework is in place that can construct a set of fault-tolerant encoded quantum gates that is capable of universal quan­ tum computation using any quantum stabilizer code. The final two sections illustrate the theory by applying it to the [5,1,3] and [4,2,2] stabilizer codes. A brief summary of universal sets of quantum gates is given in Appendix C.

CRC Press eBooks•Feb 7, 2008•0 citations

Quantum Error Correction

Daniel D. Stancil, Gregory T. Byrd

In this chapter, the authors discuss how qubit errors can be detected and corrected, leading to the development of fault-tolerant quantum computing. Error correction codes are used extensively in the classical computing realm, particularly for communicating over noisy channels or dealing with leakage errors in memory. Quantum Error Correction (QEC) codes build on these concepts, but additional features are required to deal with the nature of quantum information and errors. Many QEC codes can be conveniently and compactly described through the use of stabilizers. This description allows codes to be analyzed and developed in a more formal and systematic way. The authors introduce the stabilizer approach and describe additional QEC codes. They describe what is known as the threshold theorem, which claims that arbitrarily accurate quantum computing can be performed, provided that the error per operation is below a threshold value.

Wiley eBooks•Apr 5, 2022•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
In this chapter we begin to examine quantum stabilizer codes in detail. Sec­ tion 3.1 introduces the theoretical framework that underlies this class of quan­ tum error correcting codes, and some examples are given in Section 3.2. Sec­ tion 3.3 shows how these codes can be described in terms of a binary vector space with symplectic inner product, and finally, concatenated quantum er­ ror correcting codes are introduced in Section 3.4. The latter discussion will focus on concatenated codes that are put together using quantum stabilizer codes. We will see in Chapter 6 that concatenated codes play an important role in establishing the accuracy threshold theorem for fault-tolerant quantum computing.
In Chapters 2-5 we gave a detailed presentation of the theory of quantum error correction and fault-tolerant quantum computing. The stage is finally set for a proof of the accuracy threshold theorem [2-9]. As pointed out in Chapter 1, this theorem spells out the conditions under which quantum computing can be done reliably using imperfect quantum gates and in the presence of noise. The proof presented in this chapter follows Ref. [6]. Section 6.1 addresses a number of preliminary topics. It explains why a concatenated quantum error correcting code (QECC) should be used to protect the computational data when fault-tolerance is an issue; it states the principal assumptions underlying the threshold calculations presented in Section 6.2; and finally, it closes with a statement of the accuracy threshold theorem. The proof of this theorem is taken up in Section 6.2. For the error model introduced in Section 6.1, the accuracy threshold is calculated for gates in the Clifford group N(Qn), storage registers, and the Toffoli gate. The calculations make explicit use of the recursive structure of a concatenated QECC and the fault-tolerant procedures introduced in Chapter 5. The theorem is proved by showing that all three cases yield non-zero threshold values.
It was once widely believed that quantum computation would never become a reality. However, the discovery of quantum error correction and the proof of the accuracy threshold theorem nearly ten years ago gave rise to extensive development and research aimed at creating a working, scalable quantum computer. Over a decade has passed since this monumental accomplishment yet no book-length pedagogical presentation of this important theory exists. Quantum Error Correction and Fault Tolerant Quantum Computing offers the first full-length exposition on the realization of a theory once thought impossible. It provides in-depth coverage on the most important class of codes discovered to date—quantum stabilizer codes. It brings together the central themes of quantum error correction and fault-tolerant procedures to prove the accuracy threshold theorem for a particular noise error model. The author also includes a derivation of well-known bounds on the parameters of quantum error correcting code. Packed with over 40 real-world problems, 35 field exercises, and 17 worked-out examples, this book is the essential resource for any researcher interested in entering the quantum field as well as for those who want to understand how the unexpected realization of quantum computing is possible.
It has been known that error-correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold (probably ∼ 10 −3 –10 −6). Other, un-concatenated codes with their own attractive features—e.g., an accuracy threshold ∼ 10 −2 —have also been studied. A method to obtain universal computation is presented here which does not rely on any concatenated structure within the code itself, but instead emulates this structure with logical qubits in order to construct an encoded Toffoli gate. This realizes ∼ 10 −2 as a threshold for fault-tolerant quantum computation. 1 QEC codes and universal computation In the “space ” of all possible quantum error-correcting codes, much recent work has focused on a relatively small class, namely concatenated codes [1]–[7]. The basic idea behind these is to improve the results of a given few-qubit code by
The first theme of this book-quantum error correction-has now been pre­ sented. We carry on in this chapter with a discussion of fault-tolerant quantum computing (FTQC), which is our second theme. The discussion will take place in the context of quantum stabilizer codes and is based on Refs. [1-6]. See also Refs. [7,8]. Section 5.1 introduces the idea of fault-tolerance and makes ba­ sic definitions, while Section 5.2 presents a procedure for doing fault-tolerant quantum error correction. The theory of FTQC is then taken up in the fol­ lowing five sections. Section 5.3 examines the action of unitary operators on a quantum stabilizer code. It introduces two important groups: (i) the normalizer of the stabilizer S whose elements are encoded unitary operations; and (ii) the Clifford group which is generated by the Hadamard, phase, and CNOT gates. The discussion focuses on unitary operations that belong to the inter­ section of these two groups. By combining measurements on ancilla qubits (Section 5.4) with a four-qubit unitary operation introduced in Section 5.5, it will be possible to fault-tolerantly implement these gates on encoded data for stabilizer codes that encode a single qubit. Section 5.6 presents an extension of this approach that works for stabilizer codes encoding multiple qubits, and Section 5.7 completes the theoretical development by showing how a faulttolerant encoded Toffoli gate can be constructed for any quantum stabilizer code. By this point a theoretical framework is in place that can construct a set of fault-tolerant encoded quantum gates that is capable of universal quan­ tum computation using any quantum stabilizer code. The final two sections illustrate the theory by applying it to the [5,1,3] and [4,2,2] stabilizer codes. A brief summary of universal sets of quantum gates is given in Appendix C.
In this chapter, the authors discuss how qubit errors can be detected and corrected, leading to the development of fault-tolerant quantum computing. Error correction codes are used extensively in the classical computing realm, particularly for communicating over noisy channels or dealing with leakage errors in memory. Quantum Error Correction (QEC) codes build on these concepts, but additional features are required to deal with the nature of quantum information and errors. Many QEC codes can be conveniently and compactly described through the use of stabilizers. This description allows codes to be analyzed and developed in a more formal and systematic way. The authors introduce the stabilizer approach and describe additional QEC codes. They describe what is known as the threshold theorem, which claims that arbitrarily accurate quantum computing can be performed, provided that the error per operation is below a threshold value.
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.