Practice vocabulary for quantum error correction codes: surface code, Shor code, Steane code, stabiliser formalism, syndrome measurement, and Pauli errors.
0 / 5 completed
1 / 5
What is the 'surface code' and why is it considered the most practical QEC code?
The surface code (Kitaev toric code variant) is the leading candidate for near-term fault-tolerant quantum computing because it: (1) requires only local nearest-neighbour interactions between qubits, matching 2D chip layouts; (2) has a relatively high error threshold (~1%); (3) uses efficient classical decoding (minimum-weight perfect matching). IBM, Google, and others are building surface code implementations.
2 / 5
What is the 'Shor code' and what is its historical significance?
Peter Shor's 1995 paper introducing the first QEC code was a landmark: it proved quantum computers could, in principle, perform reliable computation despite physical noise — resolving a fundamental objection to quantum computing's practicality. The 9-qubit Shor code protects against any single-qubit error (bit flip X, phase flip Z, or both). It encodes 1 logical qubit in 9 physical qubits and demonstrated the feasibility of fault-tolerant quantum computation.
3 / 5
What is the 'stabiliser formalism' in quantum error correction?
The stabiliser formalism (Gottesman 1997) describes QEC codes in terms of a group of Pauli operators that 'stabilise' the code space — their measurement always gives +1 in the absence of errors. When an error occurs, some stabiliser measurements return -1 (the error syndrome), revealing the error's location without measuring the logical qubit. Stabiliser codes include the surface code, Steane code, and all CSS codes — they are efficiently simulable classically (Gottesman-Knill theorem).
4 / 5
What is 'syndrome measurement' in QEC and why is it remarkable?
The deep insight of QEC is that errors can be detected without learning (and therefore disturbing) the logical quantum information. Syndrome measurements measure commuting Pauli operators on ancilla qubits — the pattern of measurement outcomes (the syndrome) reveals which physical qubits have errors, without revealing the logical state. Classical decoding algorithms then determine the optimal correction to apply.
5 / 5
What are 'Pauli errors' (X, Y, Z errors) in the context of quantum error correction?
Any single-qubit error can be decomposed as a linear combination of the three Pauli operators: X (bit flip: |0⟩↔|1⟩), Z (phase flip: |+⟩↔|−⟩), and Y = iXZ (both). Because quantum errors are linear, a code that corrects X and Z errors corrects all possible single-qubit errors — this is why QEC codes are designed to detect and correct X and Z type errors on each qubit. Pauli Y = iXZ is automatically corrected when both X and Z are corrected.