Google, Caltech Cut Quantum Timelines

What happened

Caltech researchers demonstrated quantum fault-tolerance with significantly lower overhead using high-rate codes, applicable to neutral-atom or trapped-ion architectures. Concurrently, Google unveiled a lower-overhead implementation of Shor's algorithm for breaking 256-bit elliptic curve cryptography, publishing its circuit existence via a cryptographic zero-knowledge proof to avoid revealing attack details. These advancements collectively reduce the estimated physical qubits required for a quantum attack on Bitcoin signatures from millions to approximately 25,000.

Why it matters

The reduced qubit count accelerates the timeline for quantum attacks on widely used encryption, directly impacting security architects and procurement teams. This mechanism shortens the window for transitioning to quantum-resistant cryptography, as current estimates for breaking 256-bit elliptic curve cryptography now require substantially fewer resources. Organisations must prioritise evaluating and implementing post-quantum cryptographic solutions to mitigate the risk of "harvest now, decrypt later" attacks, where encrypted data is collected today for future decryption by quantum computers.