
Google Quantum AI Cuts Logical Qubit Overhead by 20x Using Distance-5 Surface Code in 2024 Test
Google's distance-5 surface code experiment demonstrates sub-threshold logical error rates with markedly lower qubit overhead than earlier surface-code implementations. The result tightens the timeline for early fault-tolerant algorithms but still leaves leakage and decoding latency as open engineering problems. Independent replication on non-superconducting platforms will determine whether the efficiency gain is hardware-specific.
The team ran repeated stabilizer measurements on a 49-qubit superconducting processor, comparing distance-3 and distance-5 codes under identical noise. They achieved a logical error rate of 0.143% per cycle for the larger code, crossing below the physical error rate for the first time with fewer resources than prior thresholds predicted. This directly addresses the scaling barrier that has kept fault-tolerant quantum computing out of reach.
Prior demonstrations, including Google's own 2023 distance-3 result, required exponential qubit growth to suppress errors. The new protocol reuses syndrome data across cycles and applies adaptive decoding, cutting the resource multiplier while maintaining below-threshold performance. Related work from Quantinuum and IBM shows similar trends but still relies on heavier overhead or different hardware.
The advance matters because Shor's algorithm and large-scale chemistry simulations need thousands of logical qubits; at current efficiencies this remains prohibitive. If the observed scaling holds, the qubit count for a cryptographically relevant machine drops from millions to hundreds of thousands.
Next steps require demonstrating the same efficiency on a 1000-qubit device with real-time decoding latency under 1 microsecond and extending the code to handle leakage errors that the current experiment largely ignored.
Google Quantum AI: Distance-7 logical error rate below 10^-4 per cycle demonstrated on a 200+ qubit array by end of 2026
Sources (2)
- [1]Primary Source(https://www.nature.com/articles/s41586-024-07234-3)
- [2]Supporting Source(https://arxiv.org/abs/2403.00912)