Two quantum‑computing breakthroughs landed this week. A Caltech team, with John Preskill, demonstrated fault‑tolerant error correction using high‑rate codes that cut overhead dramatically. The approach fits neutral‑atom platforms and any architecture that supports non‑local gates, such as trapped ions. Researchers claim the scheme could halve the resource gap that has stalled large‑scale QC.

Google’s group unveiled a streamlined version of Shor’s algorithm capable of factoring a 256‑bit elliptic curve, a target long considered out of reach. Rather than releasing the circuit blueprint, they posted a cryptographic zero‑knowledge proof confirming its existence, marking the first mathematical result disclosed in that fashion. The move signals both confidence and caution among quantum cryptographers.

Both papers shrink the qubit budget needed for a practical attack. Caltech estimates roughly 25,000 physical qubits could run the combined protocol, whereas a year ago estimates ran into the millions. That contraction brings Bitcoin’s ECDSA signatures into the plausible quantum‑threat horizon, accelerating pressure on wallets and exchanges to adopt post‑quantum alternatives.

Given the narrowed resource gap, organizations handling cryptographic assets should transition to quantum‑resistant schemes without delay. The Caltech and Google results demonstrate that the theoretical barrier is sliding, and waiting for a future “safe window” no longer seems viable.