Quantum computing bombshells that are not April Fools (scottaaronson.blog)

The post discusses two major quantum-computing advances announced around the same time: a Caltech result on quantum fault-tolerance with lower overhead, and a Google result implementing Shor’s algorithm to target 256-bit elliptic-curve cryptography using a lower-overhead circuit. Aaronson notes Google’s choice to “publish” via a zero-knowledge proof, which verifies the circuit’s existence without revealing full details, and argues the combined effect reduces the estimated qubit requirements for relevant attacks—potentially making quantum risks to currently used cryptography arrive sooner. The takeaway is renewed urgency to transition to quantum-resistant cryptography.