We provide a basic introduction of the core ideas and theory surrounding fault-tolerant quantum computation. Quantum fault-tolerance essentially refers to avoiding the uncontrollable cascade of errors caused by the interaction of quantum-bits. The presented concepts underlay the theoretical framework of large-scale quantum computation and are the driving force for many recent experimental efforts to construct small to medium sized arrays of controllable quantum bits. We examine the basic principles of redundant quantum encoding, required to protect quantum bits from errors generated from both imprecise control and environmental interactions. The novelty of this work consists in the presentation of fault-tolerance principles from a classical distributed computing perspective, as this enables a more straightforward introduction without sacrificing generality. The practicality of fault-tolerant quantum computing is analysed after introducing a metric of scalability and discussing the factors influencing it.
We provide a basic introduction of the core ideas and theory surrounding fault-tolerant quantum computation. Quantum fault-tolerance essentially refers to avoiding the uncontrollable cascade of errors caused by the interaction of quantum-bits. The presented concepts underlay the theoretical framework of large-scale quantum computation and are the driving force for many recent experimental efforts to construct small to medium sized arrays of controllable quantum bits. We examine the basic principles of redundant quantum encoding, required to protect quantum bits from errors generated from both imprecise control and environmental interactions. The novelty of this work consists in the presentation of fault-tolerance principles from a classical distributed computing perspective, as this enables a more straightforward introduction without sacrificing generality. The practicality of fault-tolerant quantum computing is analysed after introducing a metric of scalability and discussing the factors influencing it.
In this paper we provide a basic introduction of the core ideas and theories surrounding fault-tolerant quantum computation. These concepts underly the theoretical framework of large-scale quantum computation and communications and are the driving force for many recent experimental efforts to construct small to medium sized arrays of controllable quantum bits. We examine the basic principals of redundant quantum encoding, required to protect quantum bits from errors generated from both imprecise control and environmental interactions and then examine the principals of fault-tolerance from largely a classical framework. As quantum fault-tolerance essentially is avoiding the uncontrollable cascade of errors caused by the interaction of quantum-bits, these concepts can be directly mapped to quantum information.
Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspects of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large-scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large-scale quantum algorithms. In response, we have attempted to summarize the basic aspects of quantum error correction and fault-tolerance, not as a detailed guide, but rather as a basic introduction. The development in this area has been so pronounced that many in the field of quantum information, specifically researchers who are new to quantum information or people focused on the many other important issues in quantum computation, have found it difficult to keep up with the general formalisms and methodologies employed in this area. Rather than introducing these concepts from a rigorous mathematical and computer science framework, we instead examine error correction and fault-tolerance largely through detailed examples, which are more relevant to experimentalists today and in the near future.
One of the applications of quantum error correction is protecting quantum computers from noise. Certainly, there is nothing particularly quantum mechanical in the idea of protecting information by encoding it. Even ordinary digital computers use various fault tolerance methods at the software level to correct errors during the storage or the transmission of information; e.g., the integrity of the bits stored in hard disks is verified by using parity checks (checksums). In addition, for critical computing systems such as those inside airplanes or nuclear reactors, software fault tolerance methods are also applied during the processing of information; e.g., airplane control computers compare the results from multiple parallel processors to detect faults. In general, however, the hardware of modern computers is remarkably robust to noise, so that for most applications the processing of information can be executed with high reliability without using software error correction. In contrast to the ease and robustness with which classical information can be processed, the processing of quantum information appears at present to be much more challenging. Although constructing reliable quantum computing hardware is certainly a daunting task, we have nevertheless strong hopes that large-scale quantum computers, able to implement useful long computations, can in fact be realized. This optimism is founded on methods of quantum fault tolerance , which show that scalable quantum computation is, in principle, possible against a variety of noise processes.
Abstract Quantum computing1—the processing of information according to the fundamental laws of physics—offers a means to solve efficiently a small but significant set of classically intractable problems. Quantum computers are based on the controlled manipulation of entangled quantum states, which are extremely sensitive to noise and imprecision; active correction of errors must therefore be implemented without causing loss of coherence. Quantum error-correction theory2, 3, 4, 5, 6, 7, 8, 9 has made great progress in this regard, by predicting error-correcting ‘codeword’ quantum states. But the coding is inefficient and requires many quantum bits10, 11, 12, which results in physically unwieldy fault-tolerant quantum circuits10, 11, 12, 13, 14, 15, 16, 17, 18. Here I report a general technique for circumventing the trade-off between the achieved noise tolerance and the scale-up in computer size that is required to realize the error correction. I adapt the recovery operation (the process by which noise is suppressed through error detection and correction) to simultaneously correct errors and perform a useful measurement that drives the computation. The result is that a quantum computer need be only an order of magnitude larger than the logic device contained within it. For example, the physical scale-up factor10, 11 required to factorize a thousand-digit number is reduced from 1, 500 to 22, while preserving the original tolerated gate error rate (10−5) and memory noise per bit (10−7). The difficulty of realizing a useful quantum computer is therefore significantly reduced.
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 computation and information is one of the most exciting developments in science and technology of the last twenty years. To achieve large scale quantum computers and communication networks it is essential not only to overcome noise in stored quantum information, but also in general faulty quantum operations. Scalable quantum computers require a far-reaching theory of fault-tolerant quantum computation. This comprehensive text, written by leading experts in the field, focuses on quantum error correction and thoroughly covers the theory as well as experimental and practical issues. The book is not limited to a single approach, but reviews many different methods to control quantum errors, including topological codes, dynamical decoupling and decoherence-free subspaces. Basic subjects as well as advanced theory and a survey of topics from cutting-edge research make this book invaluable both as a pedagogical introduction at the graduate level and as a reference for experts in quantum information science.