An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation

Abstract

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 error-correcting 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.

46 pages, with large margins. Includes quant-ph/0004072 plus 30 pages of new material, mostly on fault-tolerance

Cited by in corpus (64)

• Quantum Computing in the NISQ era and beyond
• Quantum Error Correction for Quantum Memories
• Quantum Error Correction for Beginners
• Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
• Scalable probes of measurement-induced criticality
• Quantum technologies need a Quantum Energy Initiative
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Verification of quantum computation: An overview of existing approaches
• Designing quantum memories with embedded control: photonic circuits for autonomous quantum error correction
• Template-assisted scalable nanowire networks
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Hardware for Dynamic Quantum Computing
• Coherence in quantum error-correcting codes
• Exploring the trade-off between fidelity- and time-optimal control of quantum unitary transformations
• Asymptotic theory of quantum channel estimation
• Limitations in quantum computing from resource constraints
• Exploring the Tensor Networks/AdS Correspondence
• Experimental Demonstration of Logical Magic State Distillation
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• Constructing optimal quantum error correcting codes from absolute maximally entangled states
• Path-Independent Quantum Gates with Noisy Ancilla
• Approximate quantum error correction for generalized amplitude damping errors
• Quantum Stabilizer Codes for Correlated and Asymmetric Depolarizing Errors
• Fast binomial-code holonomic quantum computation with ultrastrong light-matter coupling
• Locality-Preserving Logical Operators in Topological Stabiliser Codes
• Transitions in Entanglement Complexity in Random Circuits
• Logical operator tradeoff for local quantum codes
• Readout Rebalancing for Near Term Quantum Computers
• Introduction to Quantum Error Correction and Fault Tolerance
• Understanding Quantum Control Processor Capabilities and Limitations through Circuit Characterization
• Geometric Algebra and Information Geometry for Quantum Computational Software
• Tensor-network codes
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements
• Exponentially tighter bounds on limitations of quantum error mitigation
• The Energy Cost of Controlling Mesoscopic Quantum Systems
• Short Codes for Quantum Channels with One Prevalent Pauli Error Type
• Scalable characterization of localizable entanglement in noisy topological quantum codes
• Bridging Paradigms: Designing for HPC-Quantum Convergence
• SimuQ: A Framework for Programming Quantum Hamiltonian Simulation with Analog Compilation
• Single-Step Parity Check Gate Set for Quantum Error Correction
• Modifying method of constructing quantum codes from highly entangled states
• Local tensor-network codes
• Limits of optimal control yields achievable with quantum controllers
• Repetition Versus Noiseless Quantum Codes For Correlated Errors
• Hybrid quantum computing with ancillas
• $\psi$-epistemic interpretations of quantum theory have a measurement problem
• Quantum error-correcting codes and their geometries
• Reductions to IID in Device-independent Quantum Information Processing
• Kerdock Codes Determine Unitary 2-Designs
• Analysis of optical quantum state preparation using photon detectors in the finite-temporal-resolution regime
• Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies
• Spanning Tree Matching Decoder for Quantum Surface Codes
• Phonon-induced Majorana Qubit Relaxation in Tunnel-Coupled Two-Island Topological Superconductors
• Distinguishing Phases via Non-Markovian Dynamics of Entanglement in Topological Quantum Codes under Parallel Magnetic Field
• Computing Electronic Correlation Energies using Linear Depth Quantum Circuits
• A NEAT Quantum Error Decoder
• The resource cost of large scale quantum computing
• Entangling Nuclear Spins by Dissipation in a Solid-state System
• Quantum Software Ecosystem Design
• Frame representations of qudit quantum mechanics
• Modave Lectures on Quantum Information: An Introduction to Channels and Applications to Black Holes and AdS/CFT
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays
• Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes