Quantum Error Correction

The actual physical implementation of a quantum bit — whether a superconducting circuit, trapped ion, photon, or spin — subject to decoherence, gate errors, and measurement errors. Distinguished from the logical qubit it helps encode.

"IBM's 127-qubit Eagle processor contains 127 physical qubits, but their error rates (0.1–1% per gate) mean they cannot perform arbitrarily long computations reliably — fault-tolerant algorithms will require thousands of physical qubits to encode each logical qubit."

A fault-tolerant qubit encoded across many physical qubits using quantum error correction — behaving like an ideal, error-free qubit to the algorithm layer despite the noise of the underlying physical qubits.

"Google's 2023 error correction experiment demonstrated that a logical qubit encoded using the surface code across 49 physical qubits had a lower error rate than the best individual physical qubit — the first experimental evidence that logical qubits can outperform their physical components."

The ratio of physical qubits required to encode one logical qubit at a target error rate — a key metric for estimating the hardware resources needed for fault-tolerant quantum computing. Current estimates suggest 1,000–10,000 physical qubits per logical qubit for practical algorithms.

"At current physical error rates (~0.1%), the surface code requires approximately 1,000 physical qubits per logical qubit to reach logical error rates below 10⁻¹⁵. Running Shor's algorithm to break RSA-2048 would require roughly 4 million physical qubits — illustrating the scale of the qubit overhead challenge."

The leading quantum error correction code for superconducting qubit architectures — arranging qubits on a 2D lattice where data qubits are interleaved with measurement (ancilla) qubits. Its nearest-neighbour connectivity requirement matches naturally with chip-level qubit layouts.

"The surface code's appeal is its high fault-tolerance threshold (~1% physical error rate) and its 2D nearest-neighbour connectivity requirement — both properties are achievable with current superconducting hardware, making it the dominant error correction strategy for companies like Google and IBM."

A broad class of quantum error correcting codes defined by a set of commuting Pauli operators (stabilizers) whose simultaneous +1 eigenstates encode the logical qubit — errors are detected by checking for stabilizer violations without measuring the logical qubit directly. The surface code is a specific stabilizer code.

"Stabilizer codes are the workhorse of quantum error correction because measuring stabilizers reveals error syndromes without collapsing the logical qubit state — the same principle that lets us detect and correct bit-flip and phase-flip errors simultaneously in a topologically protected code."

The periodic measurement of stabilizer operators to detect errors in a quantum error correcting code — the measurement outcome (syndrome) identifies the location and type of error without revealing the logical qubit's encoded information.

"In the surface code, syndrome measurements are performed on ancilla qubits after each error correction cycle — a sequence of syndrome measurements over time creates a 3D syndrome history that the classical decoder processes to infer the most likely error chain and apply a correction."

Quantum computing using logical qubits protected by error correction, where gate operations, measurements, and error correction themselves are performed in a way that prevents errors from spreading catastrophically — enabling arbitrarily long quantum computations within physical hardware limitations.

"We are still in the pre-FTQC era: current noisy intermediate-scale quantum (NISQ) devices run shallow circuits before decoherence dominates. Achieving FTQC requires both sufficient qubit quality and the engineering of fault-tolerant gate sets — a milestone expected to unlock practical quantum advantage for chemistry and cryptography applications."

The minimum number of physical qubit errors required to cause a logical error that cannot be detected — the primary parameter controlling a code's error suppression. A distance-d surface code can correct up to ⌊(d−1)/2⌋ errors; increasing distance increases protection but also increases qubit overhead.

"We compared distance-3 and distance-5 surface code patches in simulation: the distance-3 code tolerates up to 1 error before logical failure, while distance-5 tolerates up to 2 errors. The distance-5 code requires 49 physical qubits versus 17 for distance-3 — a hardware cost that must be justified by the target logical error rate."

A single-qubit rotation gate (π/8 phase) that, combined with Clifford gates, forms a universal gate set for quantum computation. Unlike Clifford gates, the T gate cannot be implemented fault-tolerantly using simple transversal methods in most codes — requiring the costly magic state distillation process.

"The T gate is the bottleneck in fault-tolerant quantum circuit compilation — every T gate in a quantum algorithm requires a magic state prepared through distillation, which consumes hundreds of physical qubits and many error correction cycles. Algorithm optimisation focuses heavily on T-count reduction."

A fault-tolerant protocol that converts many noisy copies of a special quantum state (magic state) into fewer, higher-fidelity copies using only Clifford operations — providing the resource needed to implement non-Clifford gates (like the T gate) fault-tolerantly.

"Magic state distillation is the most resource-intensive part of fault-tolerant quantum computing: a single high-fidelity T gate may require a distillation factory consuming 1,000 physical qubits running for 1,000 error correction cycles. Reducing magic state overhead is an active area of research in quantum resource estimation."

A proposed qubit architecture where quantum information is encoded in the global topological properties of a physical system — making it intrinsically protected against local noise without requiring active error correction. Based on non-Abelian anyons, particularly Majorana zero modes.

"Microsoft's quantum computing strategy is built on topological qubits using Majorana zero modes — the bet is that topological protection reduces the physical qubit overhead for fault tolerance dramatically compared to surface codes, potentially enabling practical quantum computers with far fewer total qubits."

A foundational result in quantum error correction stating that if the physical error rate per gate falls below a threshold value (typically ~1%), it is possible to perform arbitrarily long quantum computations with only polynomial overhead in physical resources.

"The quantum threshold theorem gives the field its theoretical foundation: once physical gate fidelity exceeds ~99%, fault-tolerant quantum computing becomes possible in principle. Current superconducting qubits achieve 99.5% two-qubit gate fidelity in research settings — technically above threshold, with the remaining challenge being scaling to the millions of qubits practical algorithms require."