Google Willow

Google's Willow chip, a 105-qubit superconducting processor, achieved something the quantum computing field has been working toward for more than two decades: error correction that improves as the system scales. Published in Nature, the result demonstrated what researchers call 'below threshold' error correction — the point at which adding more qubits to the error-correction array decreases the logical error rate rather than increasing it. The experimental proof was elegant. Google tested the same error correction code on arrays of 3x3, 5x5, and 7x7 physical qubits. With each step up in array size, the logical error rate dropped exponentially. This is precisely what the theory of quantum error correction has always predicted should happen — but it had never been demonstrated in hardware until Willow. The implication is profound: the path to a fault-tolerant quantum computer with thousands of logical qubits is now empirically open, not merely theoretically possible. The accompanying benchmark result generated significant media attention: Willow completed a specific computation in under five minutes that would take the world's best classical supercomputer an estimated 10 septillion years — a number larger than the age of the universe. Critics rightly noted that the benchmark task was specifically chosen to favor quantum systems and has no direct commercial application. That critique is valid but misses the point: the benchmark validates the error correction architecture, not just the computational speed. Willow remains in the NISQ-adjacent era — 105 physical qubits are nowhere near the millions needed for Shor's algorithm. But the below-threshold result transforms the scaling roadmap from aspiration to engineering execution. IBM, Microsoft, and every other quantum hardware team now have an empirically validated target to beat.