Quantum error correction is the set of techniques that protect quantum information from decoherence and operational errors by encoding one logical qubit into many physical qubits, the engineering primitive that makes fault-tolerant quantum computing possible. The classical analogue (repetition codes that triple-check every bit) does not work directly on quantum information because the no-cloning theorem forbids copying an unknown quantum state. The 2024-2026 wave of error-correction demonstrations (Google Willow, Quantinuum Helios at 48 logical qubits, QuEra at 96 logical qubits, Atom Computing at 24 logical qubits via Microsoft, Alice and Bob bosonic cat qubits at one-hour bit-flip lifetimes) finally moved the field from theoretical certainty to working hardware.
1. Quantum error correction encodes one logical qubit into many physical qubits. The redundancy lets the hardware detect and correct errors without measuring the encoded quantum state directly, the only known route to fault-tolerant quantum computing at scale.
2. The threshold theorem proves quantum error correction can work. If the physical-qubit error rate sits below a code-specific threshold (typically 10^-2 to 10^-3 for the surface code), logical-error rates can be driven arbitrarily low by growing the code distance.
3. Surface codes are the dominant near-term approach. Google Willow demonstrated in December 2024 that surface-code logical-error rates fall exponentially with code distance on superconducting hardware, the first published empirical proof of below-threshold operation.
4. High-rate qLDPC codes are the 2026 wave. IBM Kookaburra 2026 introduces qLDPC quantum memory with a Logical Processing Unit, QuEra (Nature, 2026) used a high-rate [[16,6,4]] code to encode up to 96 logical qubits, and the qLDPC approach offers far better physical-to-logical ratios than the surface code.
5. Bosonic codes give a fundamentally different route. Alice and Bob cat qubits, GKP encoding (Xanadu), and dual-rail cavity qubits (Quantum Circuits Inc inside D-Wave) push error suppression into the hardware itself, reducing the physical-qubit overhead per logical qubit.
6. The verified logical-qubit count is the new headline benchmark. QuEra 96 (Jan 2026, corrected), Quantinuum Helios 48 (Nov 2025, detected), Infleqtion 12 via post-selection (2025), Atom Computing 24 (Nov 2024, detected), Google Willow 1 (Dec 2024, corrected) are the published numbers as of mid-2026, tracked on the QZ logical-qubit leaderboard.
7. Magic state distillation remains the fault-tolerance bottleneck. Most quantum error correction codes implement Clifford gates natively but need T-gate magic states for universal computation, and the resource overhead of distilling those states dominates the cost of useful fault-tolerant quantum computation.
Quantum error correction without the maths
The simplest analogy is sending a postcard with three copies of the same word. If one copy gets smudged in the mail, the receiver picks the majority vote and recovers the original. The classical-information version is called a repetition code and it is the cleanest example of error correction in the digital world. Quantum information cannot be copied directly because of the no-cloning theorem, so the quantum version has to do something cleverer: spread the information across many physical qubits in a way that lets you detect errors without ever measuring the encoded information itself.
Imagine watching a dancer’s shadow on a wall instead of watching the dancer. The shadow tells you about the dancer’s movement without disturbing the dance. Error correction works the same way: the encoded quantum information is the dancer, the syndrome measurements are the shadow, and the correction-decision algorithm uses the syndromes to figure out which error happened and how to undo it, all without measuring the dancer directly. If you measured the dancer (the encoded quantum information) directly, you would collapse the superposition that makes quantum computing useful in the first place.
The economic shape of the problem is brutal. Today’s physical qubits make errors at rates around one in one thousand or one in ten thousand per gate, and even modest useful quantum algorithms need billions of operations. Without error correction, the noise would scramble the answer long before the computation finished. The fix is to encode each useful logical qubit into many physical qubits, run continuous error-detection-and-correction cycles, and produce a logical qubit whose effective error rate is far below the physical-qubit error rate. The cost is steep: today’s logical qubits need anywhere from dozens to thousands of physical qubits each, and the field is in a race to drive that ratio down.
The 2024-2026 wave of experimental demonstrations finally crossed the threshold from theory to working hardware. Google Willow proved that the logical-error rate falls exponentially as the code distance grows on superconducting hardware, QuEra encoded up to 96 logical qubits on neutral-atom hardware, Quantinuum Helios runs 48 detection-encoded logical qubits on trapped-ion hardware, and Alice and Bob cat qubits achieved bit-flip lifetimes exceeding one hour through bosonic-code hardware-level protection. The race is no longer about whether the correction works but about which code family scales fastest to commercially useful logical-qubit counts. Hundreds more code families exist beyond the handful described here; the community’s quantum error correction zoo catalogues them all.
Quantum error correction encodes one logical qubit into many physical qubits so that errors can be detected and corrected without measuring the encoded information. The 2024-2026 demonstrations on Willow, Helios, QuEra, Atom Computing, and Alice and Bob hardware moved the field from theoretical certainty to working logical qubits across every major modality.
What is quantum error correction, exactly?
Quantum error correction (QEC) is the set of techniques that protect a quantum state against decoherence and operational errors by encoding it into a larger Hilbert space and measuring stabilizer operators that detect (without revealing) errors on the encoded subspace. Mathematically, an error-correcting code is a subspace of a larger Hilbert space chosen so that the most likely errors map the encoded states into orthogonal error subspaces, which lets a syndrome measurement project the system into a known error and a recovery operation restore the original state.
Operationally, the QEC cycle is: prepare the encoded logical qubit, run a layer of physical-qubit gates, measure the stabilizer operators to extract the error syndrome, classically decode the syndrome to identify the most likely error, apply the corresponding recovery operation, repeat. The cycle runs fast enough (microseconds in superconducting, milliseconds in trapped-ion and neutral-atom) that errors are caught before they cascade, and the logical-qubit error rate ends up far below the physical-qubit error rate when the code distance is large enough.
A brief history of quantum error correction
The field began with Peter Shor’s 1995 paper showing that a nine-qubit code can protect a single logical qubit against arbitrary single-qubit errors, the foundational result that proved correcting quantum errors is possible at all. Andrew Steane’s 1996 seven-qubit code and the broader stabilizer formalism of Daniel Gottesman, together with the GF(4) code framework of Calderbank, Rains, Shor, and Sloane, formalised the field through the late 1990s. Alexei Kitaev’s 1997 toric-code proposal (published in Annals of Physics in 2003) provided the topological-quantum-computation roadmap that has dominated near-term hardware planning for over two decades, and Knill, Laflamme, and Zurek proved the threshold theorem (with independent proofs by Aharonov and Ben-Or, by Kitaev, and others) that guarantees fault-tolerant computation is possible if physical-error rates sit below a code-specific threshold.
The first experimental demonstrations of quantum error correction at the few-qubit level appeared in trapped-ion and superconducting hardware across the 2010s, but the modality’s big break came in December 2024 when Google’s Willow chip showed exponential suppression of logical-error rates as the surface-code distance grew. The 2025-2026 wave produced 48 logical qubits on Quantinuum Helios, 96 logical qubits on QuEra neutral-atom hardware, 24 logical qubits on Atom Computing via Microsoft, and 12 logical qubits via post-selection on Infleqtion, the period when the modality crossed from theoretical certainty to working hardware on every major platform.
Quantum error correction milestones, 1995 to 2026
The field moved from a single foundational paper to working hardware across every major modality in three decades. The timeline below marks the results that changed what was considered possible, from Shor’s first code to the below-threshold demonstrations of the 2024-2026 wave. Each entry is a published result rather than a roadmap promise, which is what separates the recent period from the two decades of theory that preceded it.
Why quantum systems need error correction
Quantum systems are exquisitely sensitive to their environment. Every coupling between the qubit and its surroundings (stray electromagnetic fields, thermal phonons, scattered laser photons, classical-electronic noise on the control wiring) drives decoherence, the process where the encoded quantum information leaks into the environment and the state collapses to a classical mixture. Physical qubits at the 2026 state of the art have coherence times measured in microseconds (superconducting) to seconds (trapped-ion, neutral-atom), and even at the high end the lifetime is far shorter than a useful quantum algorithm needs.
The other source of error is operational: every quantum gate has a non-zero probability of producing the wrong output, set by control-pulse imperfections, calibration drift, crosstalk between neighbouring qubits, and the intrinsic decoherence that happens during the gate itself. The 2026 state of the art is roughly 99.99% two-qubit gate fidelity demonstrated in the lab on trapped-ion hardware by Oxford Ionics (now part of IonQ), with Quantinuum’s trapped-ion Helios around 99.9%, 99.5-99.9% on superconducting processors such as IBM Heron R2, and around 99.5% on neutral-atom systems (Atom Computing, QuEra). Even at these numbers, a billion-operation algorithm sees roughly 10,000 to 100,000 errors with no error correction in place, far more than enough to scramble any useful output.
The classical-computing analogy understates the problem. Classical bits have effective error rates around one in 10^17 per operation because thermal noise is so far below the bit-flip energy barrier that errors are vanishingly rare. Quantum qubits operate close to the noise floor by design, and the only way to get useful error rates is active correction at every level of the stack. Quantum error correction is therefore not an optional feature like classical RAID; it is the foundational primitive that makes fault-tolerant quantum computing thinkable at all.
The errors quantum error correction has to catch
Quantum errors are richer than the single failure mode of a classical bit. A classical bit can only flip from 0 to 1, but a qubit lives in a continuous state space, so the noise that hits it takes several distinct forms that a code has to handle at once. The useful insight from the stabilizer framework is that correcting just two discrete error types, bit-flips and phase-flips, is enough to correct any single-qubit error, because an arbitrary error decomposes into a combination of those two.
The relative phase between 0 and 1 flips sign, an error with no classical analogue. It is invisible to a naive bit-copy scheme, which is one reason quantum codes need a fundamentally different structure.
The qubit leaves its computational space entirely, hiding in a higher energy level of the physical device. Leakage is not a simple X or Z error, so hardware needs dedicated leakage-reduction circuits to pump the population back.
A qubit is lost or knocked out, but the hardware knows which qubit it was. A known-location error is far easier to correct than an unknown one, which is what makes erasure conversion so valuable.
Erasure conversion is one of the most important hardware ideas of the 2024-2026 wave. Neutral-atom and dual-rail superconducting platforms can engineer their dominant errors so that the hardware flags exactly which qubit failed, turning hard-to-locate errors into easy-to-locate erasures. Alice and Bob cat qubits push the same idea furthest on the bit-flip axis, suppressing bit-flips at the hardware level so that the outer code only has to correct phase-flips. The practical payoff is a lower physical-qubit overhead per logical qubit, because a code that knows where an error happened can correct twice as many errors at the same code distance.
Physical qubits versus logical qubits
The vocabulary every quantum error correction paper assumes is the distinction between physical and logical qubits.
A single hardware qubit (transmon, trapped ion, neutral atom, photon, cat qubit) with its native error rate. The 2026 state of the art is roughly 99.5-99.99% two-qubit gate fidelity depending on modality.
A protected qubit built from many physical qubits through a quantum error correction code. Has much lower error rate than the underlying physical qubits, at the cost of using anywhere from 10 to 1000+ physical qubits per logical qubit.
The minimum number of physical errors that can turn one logical state into another; a distance-d code corrects up to (d-1)/2 of them. A distance-d surface code uses on the order of 2d^2 physical qubits per logical qubit (d^2 data qubits plus the ancillae that measure them) and corrects up to (d-1)/2 errors. Higher distance means lower logical-error rate but more physical qubits per logical qubit.
A logical qubit demonstrated experimentally with measured below-threshold operation (logical-error rate lower than physical-qubit error rate). QuEra holds the current record at up to 96 verified logical qubits (Nature, 2026).
The ratio of physical qubits to logical qubits. Surface code at distance 11 uses 121 data qubits plus a similar number of ancillae, roughly 241 physical qubits per logical qubit; qLDPC codes can do far better; bosonic codes like Alice and Bob cat qubits push the ratio to single digits per logical qubit.
A multi-qubit operator that commutes with the encoded subspace and whose measurement reveals the error syndrome without disturbing the encoded information. The stabilizer formalism is the dominant mathematical framework for quantum error correction codes.
The threshold theorem
The threshold theorem (Knill-Laflamme-Zurek; Aharonov-Ben-Or; Kitaev; and independent contributions from many others in the late 1990s) is the foundational result that makes quantum computing possible at all. The statement is that if the physical-qubit error rate sits below a code-specific threshold (typically 10^-2 to 10^-3 for the surface code), then by growing the code distance the logical-error rate can be driven arbitrarily low with only polynomial overhead in physical-qubit count.
The threshold value depends on the code family and the error model. For the surface code on independent depolarising noise, the threshold sits around 1% physical-qubit error rate. For high-rate qLDPC codes the threshold is also around 1% but the encoding overhead is much smaller. For bosonic codes like the cat qubit, the “threshold” for one error type (bit-flip) can be pushed to essentially zero through hardware protection, while the other error type (phase-flip) is corrected by an outer code at the standard threshold. The practical importance is that hardware-error rates only need to sit below the threshold for the code to work, and they only need to keep falling for the logical-error rate to keep falling exponentially.
The Google Willow December 2024 result is the canonical experimental demonstration of the threshold theorem in working hardware. Google ran the surface code at three different code distances on the same chip and showed that the logical-error rate fell roughly by a factor of two every time the code distance increased by two, exactly the exponential suppression that the threshold theorem predicts. The result also confirmed that the surface-code threshold on Willow hardware sits below the chip’s native physical-error rate, which is the empirical bar that any fault-tolerant quantum-computing roadmap has to clear.
The major quantum error correction code families
Five code families dominate the 2026 quantum error correction landscape.
Surface codes
The surface code is the dominant near-term approach, anchored by Google Willow, IBM Heron, and most neutral-atom logical-qubit demonstrations; trapped-ion machines, with their all-to-all connectivity, favour concatenated and qLDPC codes instead. The code lays out physical qubits on a 2D lattice with nearest-neighbour stabilizer measurements, which maps cleanly to chip-fabrication and ion-trap geometries. The threshold is around 1% and the encoding overhead at distance 11 is roughly 241 physical qubits per logical qubit (121 data qubits plus ancillae), which is high but tractable on the 1000+-qubit machines that IBM, Quantinuum, QuEra, and Atom Computing now operate. The surface code’s killer feature is geometric locality: every stabilizer involves only four nearest-neighbour qubits, which makes hardware implementation straightforward across many modalities.
qLDPC codes
Quantum low-density-parity-check (qLDPC) codes are the 2026 frontier, offering far better physical-to-logical ratios than the surface code at the cost of long-range connectivity that requires architectural innovations. The QuEra 2026 high-rate [[16,6,4]] code encodes 6 logical qubits in 16 physical atoms at code distance 4, dramatically lower overhead than the equivalent surface code. The IBM Kookaburra 2026 roadmap introduces qLDPC quantum memory plus a Logical Processing Unit that combines memory and logic in a single module, the architectural step toward IBM’s fault-tolerant Starling system. The qLDPC family is the canonical answer to “how do we avoid the surface-code overhead?” and the 2026 hardware deployments are where the practical benefits start to show.
Bosonic codes (cat, GKP, dual-rail)
Bosonic codes encode a logical qubit into infinitely-many states of a single oscillator mode rather than into many physical qubits, which moves the redundancy into the hardware itself. Alice and Bob cat qubits achieved bit-flip lifetimes exceeding one hour in September 2025 through bosonic-mode encoding, the empirical proof that hardware-level error suppression is viable. Gottesman-Kitaev-Preskill (GKP) codes are the continuous-variable photonic answer used by Xanadu in its fault-tolerance roadmap. Dual-rail cavity qubits (Quantum Circuits Inc, now inside D-Wave) encode the qubit into the parity of two coupled cavities, giving hardware-level erasure detection. The bosonic-code family is the structurally-different alternative to the standard discrete-qubit codes.
Bacon-Shor and concatenated codes
The Bacon-Shor code is a subsystem code whose gauge operators are measured two qubits at a time, which simplifies the readout hardware. Atom Computing used a Bacon-Shor code for a single-logical-qubit demonstration in its November 2024 neutral-atom work with Microsoft, while the 24-logical-qubit entanglement in the same study used the [[4,2,2]] code. Concatenated codes (where small codes are nested inside larger codes recursively) have been the historical reference for fault-tolerance theorems and remain relevant for specific applications, even though the surface code and qLDPC codes have taken over as the dominant near-term targets.
Colour codes and other topological codes
Colour codes are a topological-code family closely related to surface codes that offer better logical-gate-set support at slightly higher physical-qubit cost. The colour code has been demonstrated experimentally on Quantinuum trapped-ion hardware and remains a candidate for the next generation of fault-tolerant systems. Other topological codes (3D codes, hyperbolic codes, foliated codes for measurement-based quantum computing) populate the broader academic landscape but have not yet shipped in commercial hardware.
Code families at a glance
The table below compares the five families on the dimensions that decide which one a hardware team picks: how many physical qubits each logical qubit costs, the rough error threshold, the connectivity the hardware has to provide, and how far along the family is in real machines. No single family wins on every axis, which is why all five are still under active development in 2026.
| Code family | Overhead per logical qubit | Threshold | Connectivity | 2026 status |
|---|---|---|---|---|
| Surface code | High (~2d^2, around 241 at d=11) | ~1% | 2D nearest-neighbour | Below threshold on Willow; dominant near-term |
| qLDPC (high-rate) | Low (many logical qubits per block) | ~1% | Long-range | QuEra [[16,6,4]]; IBM Kookaburra memory |
| Bosonic (cat, GKP, dual-rail) | Very low (hardware-level protection) | Biased; bit-flip near zero | Per oscillator mode | Alice and Bob one-hour bit-flip; Xanadu GKP |
| Bacon-Shor / subsystem | Moderate | Lower than surface | Two-body gauge checks | Single-qubit demos; simple readout |
| Colour code | Higher than surface | Around 0.1 to 1% | 2D, three-colourable lattice | Demonstrated on Quantinuum trapped ions |
2026 logical-qubit milestones
The verified logical-qubit count is the dominant 2026 benchmark across modalities. The table below tracks the published demonstrations as of mid-2026.
| Vendor | Modality | Verified logical qubits | Code family | Date |
|---|---|---|---|---|
| QuEra | Neutral atom | up to 96 | [[16,6,4]] high-rate | 2026 (Nature) |
| Quantinuum Helios | Trapped ion | 48 (detected) | Concatenated iceberg [[k+2,k,2]] | November 2025 |
| Atom Computing + Microsoft | Neutral atom | 24 (detected) | [[4,2,2]] detection code | November 2024 |
| Infleqtion Sqale | Neutral atom | 12 (post-selection) | [[4,2,2]] (detection) | 2025 |
| Xanadu Aurora | Photonic (CV) | 12 | GKP | 2025 |
| Google Willow | Superconducting | 1 (verified scaling) | Surface code | December 2024 |
| Photonic Inc | Silicon-T-centre + photons | Target 4 (2026) | DARPA QBI roadmap | 2026 target |
A distance-2 code such as [[4,2,2]] or the iceberg code detects errors and discards spoiled runs rather than correcting them, so those counts are flagged as detected above. Google Willow and QuEra’s [[16,6,4]] blocks remain the entries demonstrating genuine below-threshold correction.
The leaderboard is updated frequently as new demonstrations are published; see the QZ quantum logical-qubit leaderboard for the live reference.
Who is building quantum error correction
The organisations below drive the hardware and the classical decoding stack behind these results. For the full breakdown of vendors, funding, and architectures, see our guide to the top quantum error correction companies.
Google Quantum AIWillow below-threshold surface code
IBMKookaburra qLDPC memory, Starling roadmap
QuantinuumHelios, 48 trapped-ion logical qubits
QuEraUp to 96 neutral-atom logical qubits
IonQTrapped ions, Oxford Ionics fidelity
Atom Computing24 logical qubits with Microsoft
Alice & BobCat qubits, one-hour bit-flip lifetime
RiverlaneReal-time decoding hardware
PsiQuantumMillion-qubit photonic fault tolerance
MicrosoftLogical-qubit work on Azure Quantum
Magic state distillation and universal gates
Quantum error correction codes naturally implement a subset of quantum gates fault-tolerantly (the Clifford group: Hadamard, CNOT, phase gate, and their combinations). This subset is large but not universal: it cannot implement a quantum algorithm with computational advantage over classical computers without an additional non-Clifford gate. The standard choice is the T gate (a Z rotation by 45 degrees), and the standard way to implement T fault-tolerantly is through magic state distillation, where a noisy magic state is purified into a high-fidelity magic state through a teleportation-based protocol.
Magic state distillation is the dominant resource cost of useful fault-tolerant quantum computation in 2026 architectures. The factories that produce high-fidelity T states consume a large fraction of the physical-qubit budget in surface-code architectures, and the overhead is set by the target T-gate error rate (typically 10^-9 to 10^-12 depending on the algorithm) and the distillation-protocol efficiency. The 2025-2026 wave of theoretical improvements (cultivation protocols, code switching, magic-state-free architectures, alternative non-Clifford gate implementations) is targeted at reducing this overhead, and the IBM Kookaburra Logical Processing Unit is the first architectural integration of distillation-and-compute into a single coherent stack.
The practical bound is that early fault-tolerant machines will spend most of their physical-qubit budget on magic state factories. A 1,000-logical-qubit machine targeting useful chemistry calculations needs millions of physical qubits today, the majority of which are dedicated to T-state distillation rather than to the logical-qubit computation itself. Reducing this overhead is the central engineering challenge of the next decade of quantum computing.
Quantum logical-qubit leaderboard
Top quantum error correction companies
Cryptographically relevant quantum computer
Q-Day and encryption
What is entanglement
What is quantum machine learning
Top superconducting companies
Top trapped ion companies
Top neutral atom companies
Top photonic companies
Quantum error correction glossary
The vocabulary below appears in almost every quantum error correction paper and announcement. Keeping these terms straight makes the rest of the field far easier to read, and most of the confusion in popular coverage comes from blurring them together.
- Ancilla qubit
- A helper qubit used to measure a stabilizer and extract an error syndrome without disturbing the encoded data.
- Code distance (d)
- The size parameter of a code; a distance-d code corrects up to (d-1)/2 errors, and the logical-error rate falls exponentially as d grows.
- Logical qubit
- A protected qubit encoded across many physical qubits, with an effective error rate far below that of the underlying hardware.
- Stabilizer
- A multi-qubit operator whose measurement reveals whether an error occurred without revealing the encoded information itself.
- Syndrome
- The pattern of stabilizer-measurement outcomes that a decoder reads to infer which error happened.
- Decoder
- The classical algorithm that turns a syndrome into a correction, fast enough to keep up with the hardware measurement cycle.
- Transversal gate
- A logical gate applied qubit by qubit across code blocks, naturally fault-tolerant because it does not spread errors within a block.
- Lattice surgery
- A technique for performing logical operations between surface-code patches by merging and splitting their boundaries.
- Magic state
- A specially prepared resource state that lets a code apply a non-Clifford gate such as the T gate, produced by distillation.
- Threshold
- The physical error rate below which adding more qubits reduces the logical error rate, the precondition for scalable fault tolerance.
Frequently asked questions
What is quantum error correction in simple terms?
Quantum error correction encodes a single logical qubit of useful quantum information into many physical qubits in a way that lets the hardware detect and correct errors without measuring the encoded information directly. The redundancy is necessary because physical qubits make errors at rates far higher than useful quantum algorithms can tolerate, and the no-cloning theorem prevents the simple classical approach of copying the information for backup. Working quantum error correction is the engineering primitive that makes fault-tolerant quantum computing possible at scale.
What is the difference between a physical qubit and a logical qubit?
A physical qubit is a single hardware qubit (a superconducting transmon, a trapped ion, a neutral atom in an optical tweezer, a photon, a cat qubit in a microwave cavity) with its native physical error rate. A logical qubit is a protected qubit built from many physical qubits through a quantum error correction code with a much lower effective error rate. The 2026 state of the art uses anywhere from a dozen physical qubits per logical qubit (qLDPC codes, bosonic codes) to over a thousand physical qubits per logical qubit (surface code at large distance), depending on the code family and target error rate.
What is the threshold theorem?
The threshold theorem (proved in independent forms by Knill-Laflamme-Zurek, Aharonov-Ben-Or, and others in the late 1990s) states that if the physical-qubit error rate sits below a code-specific threshold (typically 1% for the surface code), then by growing the code distance the logical-error rate can be driven arbitrarily low with only polynomial overhead. Practically the threshold means hardware-error rates only need to sit below a fixed number for fault-tolerant computing to be possible, and they only need to keep falling for the logical-error rate to keep falling exponentially. Google Willow showed in December 2024 that the surface-code threshold has been crossed on real superconducting hardware.
How does the surface code work?
The surface code lays out physical qubits on a 2D lattice and measures stabilizer operators that involve four nearest-neighbour qubits, repeating the measurement cycle every few microseconds. The syndrome (the pattern of stabilizer-measurement outcomes) tells the classical decoder which physical-qubit errors occurred and how to undo them, all without measuring the encoded logical information directly. The code distance d determines the protection level: at distance d, the code uses roughly d squared physical qubits per logical qubit and corrects up to (d-1)/2 single-qubit errors. The surface code is currently the dominant code family for superconducting and trapped-ion logical-qubit demonstrations because the 2D nearest-neighbour layout maps cleanly to standard chip-fabrication and ion-trap geometries.
What are qLDPC codes and why do they matter?
Quantum low-density-parity-check (qLDPC) codes are a code family that achieves far better physical-to-logical-qubit ratios than the surface code by using long-range connectivity rather than nearest-neighbour stabilizer measurements. The QuEra January 2026 [[16,6,4]] qLDPC code packed 6 logical qubits into 16 physical atoms at code distance 4, the demonstration that qLDPC codes deliver the predicted overhead savings on real hardware. IBM Kookaburra 2026 introduces qLDPC quantum memory plus a Logical Processing Unit, the architectural primitive that lets useful fault-tolerant computation run with manageable physical-qubit budgets. qLDPC is the 2026-2027 wave that drives the next round of logical-qubit-count improvements.
What is a cat qubit and how does it relate to quantum error correction?
A cat qubit is a bosonic-mode encoding where the qubit lives in the superposition of two coherent states of a microwave-cavity mode, structurally protected against bit-flip errors because its two encoding states sit far apart in phase space and are held there by engineered two-photon dissipation, suppressing bit-flips exponentially in the cat’s photon number while an outer code handles the remaining phase-flips. Alice and Bob achieved a one-hour bit-flip lifetime on the Helium 2 chip (Galvanic Cat design) in September 2025, the empirical proof that hardware-level error suppression in bosonic codes can work. The cat-qubit fault-tolerance approach uses an outer error-correction code only for phase-flip errors, dramatically reducing the physical-qubit-per-logical-qubit overhead compared to discrete-qubit codes like the surface code.
Who has demonstrated the most logical qubits?
QuEra holds the current record at up to 96 verified logical qubits, encoded with a high-rate [[16,6,4]] code on neutral-atom hardware and published in Nature in 2026 (the platform used up to 448 atoms across its experiments). Quantinuum Helios runs 48 detection-encoded logical qubits on trapped-ion hardware (November 2025), Atom Computing demonstrated 24 logical qubits with Microsoft on neutral-atom hardware in November 2024, Infleqtion Sqale demonstrated 12 logical qubits via post-selection in 2025, and Google Willow demonstrated 1 verified logical qubit with code-distance scaling in December 2024. The leaderboard moves quickly: every few months a new platform crosses a milestone.
Why does fault-tolerant quantum computing need magic state distillation?
Most quantum error correction codes natively implement only the Clifford group of gates (Hadamard, CNOT, phase gate, and their compositions), which is not universal for quantum computing. Useful quantum algorithms need at least one non-Clifford gate (typically the T gate) to access the full computational power of quantum mechanics. The standard fault-tolerant implementation of the T gate is through magic state distillation, where a noisy magic state is purified into a high-fidelity magic state through a teleportation-based protocol that uses only Clifford operations on the noisy magic state. Magic state distillation dominates the physical-qubit budget of early fault-tolerant machines, and reducing this overhead is the central engineering challenge of the next decade.
How long until we have a useful fault-tolerant quantum computer?
The current published roadmaps target useful fault-tolerant operation in the 2029-2033 timeframe across the leading modalities. IBM Starling targets 200 logical qubits with 100M operations in 2029, IBM Blue Jay targets 2,000 logical qubits with 1B operations in 2033, PsiQuantum is building a million-qubit utility-scale photonic machine with construction already underway, and the DARPA Quantum Benchmarking Initiative funds Atom Computing, Photonic Inc, Oxford Ionics (now part of IonQ), and several others on parallel fault-tolerance tracks toward 2033 operational milestones. The 2024-2026 demonstrations crossed the technical bar of working logical qubits across every major modality, and the remaining engineering problem is scaling physical-qubit counts and reducing magic-state-distillation overhead.
Can errors during the syndrome measurement itself be corrected?
Yes, and this is what fault-tolerance means in the technical sense. Naive implementations of error correction can introduce more errors during the syndrome measurement than they correct, so the syndrome-measurement circuits themselves have to be designed to tolerate errors. Fault-tolerant syndrome extraction uses ancilla qubits to read out stabilizers in a way that prevents single faults during the measurement from propagating into uncorrectable patterns on the encoded data. The threshold theorem accounts for these measurement errors, so the practical threshold is roughly the same as the noise-only threshold, but the fault-tolerant circuit construction is what lets the theory work in practice.
How does quantum error correction relate to fault tolerance?
Quantum error correction is the mathematical framework (codes that detect and correct errors), and fault tolerance is the engineering discipline of running quantum error correction in a way that survives errors in the correction process itself. A fault-tolerant quantum computer uses fault-tolerant gate constructions, fault-tolerant syndrome extraction, fault-tolerant magic state distillation, and a classical decoder that processes syndromes fast enough to keep up with the QEC cycle. The two terms are often used interchangeably but the strict distinction is that QEC is the math and fault tolerance is the engineering that makes the math work on noisy hardware.
What is the relationship between quantum error correction and entanglement?
Quantum error correction codes distribute the logical information across an entangled subspace of physical qubits, the same fundamental resource that makes quantum computing more powerful than classical computing. The stabilizer measurements that detect errors are entangling operations between ancilla qubits and the encoded data, and the recovery operations exploit entanglement to undo the detected errors without disturbing the encoded information. See our guide to quantum entanglement for the foundational physics, and the QEC structure is one of the canonical places where entanglement shows up as an engineering primitive rather than as a foundational-physics curiosity.
See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.
