TWO independent whitepapers argue that building a utility-scale quantum computer capable of breaking elliptic-curve cryptography does not require as many resources as previously thought. One paper shows neutral atoms used as reconfigurable qubits could break 256-bit ECC in 10 days with about 100 times less overhead, while a separate Google-backed study claims ECC-256 could be cracked for bitcoin and other cryptocurrencies in under nine minutes with a 20-fold reduction in resources.
The Google work outlines two quantum circuits solving the elliptic-curve discrete logarithm problem, needing under 1,200 to 1,450 logical qubits and tens of millions of Toffoli gates, with an overall estimate of roughly 500,000 physical qubits. Researchers emphasise that neither paper has been peer-reviewed and note that advances are driven by new architectures and improved Shor’s algorithm implementations, alongside growing fault-tolerance capabilities.
According to Brian LaMacchia, these results evidence that progress toward cryptographically relevant quantum computing is continuing, even as the field debates practical dates for deployment. Google, meanwhile, has released a zero-knowledge proof to demonstrate the existence of the algorithmic improvement without disclosing its details, prompting discussion among security researchers about disclosure and policy.