Fault-tolerant quantum computation

TL;DR

This work surveys how quantum error correction enables fault-tolerant quantum computation, focusing on the Steane $[7,1,3]$ code and its fault-tolerant recovery and gate implementations. It introduces the idea of a threshold: when physical error rates are below a critical value, concatenated codes can suppress errors exponentially with level, enabling arbitrarily long computations; practical estimates place the threshold around $\epsilon \sim 10^{-4}$ to $10^{-3}$. The paper also explores intrinsic fault tolerance via topological quantum computation, arguing that nonlocal topological degrees of freedom and Aharonov-Bohm–type interactions could yield robust quantum gates, with Kitaev’s proposals and nonabelian anyons as key examples. Together, these perspectives highlight both circuit-based and hardware-based paths toward scalable, reliable quantum computation and connect fault tolerance to broader questions in physics.

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.

Figures (21)

• Figure 1: Diagrammatic notation for the NOT gate, the XOR (controlled-NOT) gate, and the Toffoli (controlled-controlled-NOT) gate.
• Figure 2: Computation of the bit-flip syndrome for Steane's 7-qubit code. Repeating the computation in the rotated basis diagnoses the phase-flip errors. To make the procedure fault tolerant, each ancilla qubit must be replaced by four qubits in a suitable state.
• Figure 3: An encoding circuit for Steane's 7-qubit code.
• Figure 4: Destructive and nondestructive measurement of the logical qubit.
• Figure 5: A useful identity. The source and the target of an XOR gate are interchanged if we perform a change of basis with Hadamard rotations.