We review the theories of quantum error correction, and of fault-tolerant quantum computing, and show how these powerful tools are combined to prove the accuracy threshold theorem for a particular error model. One of the theorem's assumptions is the availability of a universal set of unencoded quantum gates whose error probabilities P e fall below a value known as the accuracy threshold P a . For many, P a ~ 10 -4 has become a rough estimate for the threshold so that quantum gates are anticipated to be approaching the accuracies needed for fault-tolerant quantum computing when P e < 10 -4 . We show how controllable quantum interference effects that arise during a type of non-adiabatic rapid passage can be used to produce a universal set of quantum gates whose error probabilities satisfy P e < 10 -4 . We close with a discussion of the current challenges facing an experimental implementation of this approach to reliable universal quantum computation.
We review the theories of quantum error correction, and of fault-tolerant quantum computing, and show how these powerful tools are combined to prove the accuracy threshold theorem for a particular error model. One of the theorem's assumptions is the availability of a universal set of unencoded quantum gates whose error probabilities P e fall below a value known as the accuracy threshold P a . For many, P a ~ 10 -4 has become a rough estimate for the threshold so that quantum gates are anticipated to be approaching the accuracies needed for fault-tolerant quantum computing when P e < 10 -4 . We show how controllable quantum interference effects that arise during a type of non-adiabatic rapid passage can be used to produce a universal set of quantum gates whose error probabilities satisfy P e < 10 -4 . We close with a discussion of the current challenges facing an experimental implementation of this approach to reliable universal quantum computation.
This thesis is concerned with certain theoretical problems that arise naturally in the context of fault-tolerant quantum computation. Fault-tolerance can be defined as the art of building reliable devices from unreliable components, and is of particular importance for quantum computers that aim to precisely control the dynamics of extremely sensitive quantum systems. A model of quantum computation is a specification of the basic building blocks by which a quantum computation is implemented. The best known model is the quantum circuit model, where computations are implemented by means of unitary quantum gates that are applied to two-level quantum systems known as qubits. In a physical implementation of a quantum circuit, the gates and qubits will inevitably be affected by noise. Fault-tolerant quantum circuits are designed to be resilient against the effects of this noise, provided that it is not too strong. Fault-tolerance in the quantum circuit model is well developed thanks to the theory of quantum error-correcting codes. These codes allow for the correction of small numbers of errors introduced by a variety of noise processes. In a fault-tolerant quantum circuit, qubits are replaced with encoded qubits, and quantum gates with encoded gates that are immediately followed by special quantum circuits for error correction. Provided the rate at which errors occur is below a constant threshold value, the accumulation of errors can be checked so that the correct output of the computation correctly determined. The threshold acts as both a measure of how good the design of a quantum circuit is, and also as a target for experimenters aiming to implement quantum circuits. Much current research in quantum computation is aimed at designing quantum circuits that increase the noise threshold, hopefully to the point where it becomes within the reach of experimenters. A fault-tolerant encoded quantum gate must limit the propagation of errors so that the code’s corrective capabilities are not overwhelmed. It is not so easy to design encoded gates that satisfy this property, and to date only a finite handful of such gates are known. In a faulttolerant quantum circuit, all quantum gates must be decomposed or compiled in terms of those that may be implemented fault-tolerantly. In the first part of this thesis, we present two results that may be applied to this problem of gate compilation. The first is a generic method based on the Solovay-Kitaev theorem that may be applied to all quantum gates, but is most effective for those that act on single qubits. We present the Solovay-Kitaev theorem in its simples known form as an algorithm, together with novel constructions that can be used to implement it. Following this we give a two specialized methods for two-qubit gate decomposition, based on the Cartan decomposition of the Lie group SU(4). The cluster-state model of computation is an alternative to the quantum circuit model, and makes use of quantum measurements and highly entangled cluster-states to implement a quantum computation. The fault-tolerant techniques developed for quantum circuits are not immediately applicable in this model, so in order for it to be a realistic candidate for performing computations we prove that such techniques are possible. In the second part of the thesis we prove that constant fault-tolerance thresholds may be achieved in the cluster-state model, and in particular in an adaption to an optical implementation. Following this we design a complete error correction scheme for optical cluster-state computation, and numerically determine the threshold of this model in the face of the dominant noise models likely to affect such an implementation.
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.
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment, or due to imperfect implementations of quantum logical operations. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. In principle, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per gate is less than a certain critical value, the accuracy threshold. It may be possible to incorporate intrinsic fault tolerance into the design of quantum computing hardware, perhaps by invoking topological Aharonov-Bohm interactions to process quantum information.
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.
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.
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.