Figure

Description

A surface-code logical qubit is not a new physical modality, but a fault-tolerant logical qubit encoded across a 2D lattice of physical qubits using repeated stabilizer measurements. The surface code, introduced by Kitaev (1997) and developed for practical implementation by Fowler et al. (2012), is the leading quantum error correction architecture due to its high threshold (~1% circuit-level error rate) and requirement of only nearest-neighbor interactions on a 2D grid.

Logical information is stored nonlocally across data qubits (for code distance ) and ancilla qubits used for syndrome extraction. Errors are detected via local parity checks — X-type (star) stabilizers detect Z errors, and Z-type (plaquette) stabilizers detect X errors — and corrected by decoding syndrome histories. Logical operators are non-contractible strings of Pauli operators spanning the patch, providing topological protection against local errors.

Hamiltonian

The code space is defined by star and plaquette stabilizers:

with code Hamiltonian form:

The code space is the simultaneous eigenspace of all stabilizers. Logical operators correspond to non-contractible strings across the patch: connects the two smooth boundaries and connects the two rough boundaries. The code distance is the minimum weight of any logical operator.

Motivation

The surface code is currently the dominant QEC architecture for superconducting and trapped-ion roadmaps. Its key advantages are: a high circuit-level threshold of ~1%, compatibility with nearest-neighbor 2D qubit layouts (no long-range connectivity needed), well-understood decoder algorithms (MWPM, Union-Find), and experimental accessibility with current hardware. The primary cost is overhead: physical qubits per logical qubit, with determined by the physical-to-threshold error ratio.

Experimental Status

Below-threshold operation — Google Quantum AI (2024):

  • Demonstrated logical error suppression when scaling from distance-3 to distance-5 to distance-7 on the Willow processor.
  • Achieved a error suppression factor per code distance step.
  • Distance-7 code with 101 qubits achieved error per cycle.
  • Logical memory exceeded best physical qubit lifetime by factor (beyond break-even).

Lattice surgery — Erhard et al. (2021):

  • Demonstrated entangling operations between logical qubits using lattice surgery protocols on trapped ions.

Key Metrics

MetricValueNotesFidelity reference
Logical lifetime~2× improvement per code distance stepExponential suppression of logical errors demonstrated d=3→5→7Google Quantum AI 2024
1Q gate fidelity (logical Pauli)99.6–99.8%d=5, Google Willow processorGoogle Quantum AI 2024
2Q gate fidelity (logical CNOT)~99% (estimated)Lattice surgery protocol; full demonstration pendingErhard et al. 2021
Threshold~1%Circuit-level threshold
Physical qubits per logicalCode distance
Stabilizer cycle time0.5–5 μsPlatform dependent
Current statusLogical error suppression demonstratedBelow-threshold operation at d=7Google Quantum AI 2024

Note: For QEC code entries, “T₁” refers to logical qubit lifetime (error-suppressed), and gate fidelities are logical-level operations on encoded information.

References

Original proposal

Practical implementation roadmap

Experimental demonstrations

Linked Papers

  • color-code-logical-qubit — alternative topological code with transversal Clifford gates
  • transmon — dominant physical qubit for superconducting surface code implementations
  • trapped-ion-qubit — alternative physical platform for surface code QEC
  • erasure-qubit — erasure conversion dramatically increases the effective code threshold