Fault-tolerant quantum computation

Abstract

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.

58 pages with 7 PostScript figures, LaTeX, uses sprocl.sty and psfig, to appear in "Introduction to Quantum Computation," edited by H.-K. Lo, S. Popescu, and T. P. Spiller

Cited by in corpus (63)

• Fault-tolerant quantum computation by anyons
• Quantum Computing
• Quantum Computing
• Quantum Error Correction for Quantum Memories
• Quantum Computing with Very Noisy Devices
• A Theory of Fault-Tolerant Quantum Computation
• Quantum Error Correction for Beginners
• A Superconducting Persistent Current Qubit
• Quantum computers can search rapidly by using almost any transformation
• Quantum error correction in a solid-state hybrid spin register
• Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
• Protected gates for superconducting qubits
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Efficient classical simulation of random shallow 2D quantum circuits
• Quantum Information is Physical
• Simulating chemistry efficiently on fault-tolerant quantum computers
• First-principles analysis of cross-resonance gate operation
• Anyon computers with smaller groups
• Quantum Computing: Pro and Con
• Fault-Tolerant Quantum Computation with Local Gates
• Deep Neural Network Probabilistic Decoder for Stabilizer Codes
• Quantum Computation
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Feasibility of self-correcting quantum memory and thermal stability of topological order
• An Introduction to Quantum Complexity Theory
• Performance of quantum error correction with coherent errors
• Opportunistic Entanglement Distribution for the Quantum Internet
• Quantum Error Correction with the Semion Code
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors
• Distilling one-qubit magic states into Toffoli states
• Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Quantum teleportation of physical qubits into logical code-spaces
• Optimal Universal Quantum Error Correction via Bounded Reference Frames
• Two-photon driven Kerr quantum oscillator with multiple spectral degeneracies
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• What is a quantum computer, and how do we build one?
• A Geometric Algebra Perspective On Quantum Computational Gates And Universality In Quantum Computing
• High-Level Methods for Quantum Computation and Information
• Numerical and analytical bounds on threshold error rates for hypergraph-product codes
• Universal bound on the cardinality of local hidden variables in networks
• Is error detection helpful on IBM 5Q chips ?
• Achieving fault tolerance against amplitude-damping noise
• Improving the efficiency of joint remote state preparation in noisy environment with weak measurement
• Optimization of the resonator-induced phase gate for superconducting qubits
• Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler
• Continuous quantum error correction for evolution under time-dependent Hamiltonians
• Resilience to time-correlated noise in quantum computation
• Extending the Variational Quantum Eigensolver to Finite Temperatures
• Solving optimization problems with local light shift encoding on Rydberg quantum annealers
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
• State of the art and prospects for quantum computing
• Minimal distances for certain quantum product codes and tensor products of chain complexes
• Self-correction in Wegner's 3D Ising lattice gauge theory
• Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
• Characterization of universal two-qubit Hamiltonians
• Detrimental non-Markovian errors for surface code memory
• Variance of the sum of independent quantum computing errors
• Using copies to improve precision in continuous-time quantum computing
• Modelling for Quantum Error Mitigation
• Universal set of Dynamically Protected Gates for Bipartite Qubit Networks II: Soft Pulse Implementation of the [[5,1,3]] Quantum Error Correcting Code
• Impact of Surface Treatment on Noise in PL-Measurements of Silicon Vacancies in 4H-SiC Lateral pin-Diodes