Google, Oratomic Cut Encryption-Breaking Threshold to 10,000 Qubits as ECC Risk Nears 10 Minutes
Updated
Updated · physicsworld.com · May 26
Google, Oratomic Cut Encryption-Breaking Threshold to 10,000 Qubits as ECC Risk Nears 10 Minutes
5 articles · Updated · physicsworld.com · May 26
Oratomic’s new estimate cuts the floor for breaking RSA-2048 from 100,000 physical qubits to 10,000, suggesting cryptographically relevant quantum machines may be closer than many researchers expected.
The lower threshold comes from using qLDPC error correction on neutral-atom hardware, though the trade-off is speed: Oratomic projects 3 years to crack ECC-256 with 10,000 qubits, or 10 days with 26,000.
Google Quantum AI offered a faster but larger design, estimating 500,000 superconducting qubits could break ECC-256 in 18 minutes; with precomputation, it says some Bitcoin-style attacks could fall to 9 minutes.
Those results are not equally settled: Oratomic’s work is still unreviewed, and outside experts said both groups’ timelines depend heavily on assumptions about scaling, connectivity and future hardware breakthroughs.
The findings sharpen pressure to replace RSA and ECC with post-quantum cryptography, with NIST already standardizing alternatives and Google targeting 2029 to migrate major systems.
With Google and Oratomic's competing claims, who will win the race to build a code-breaking quantum computer?
Can our global financial system migrate to quantum-safe technology before current encryption completely collapses?
While quantum threatens old money, how will it create new fortunes in a reinvented financial system?
Quantum Computing in 2026: Urgent Action Required as 10,000-Qubit Machines Threaten Global Encryption and Digital Trust
Overview
Recent breakthroughs in quantum error correction, especially the development of advanced quantum Low-Density Parity-Check (qLDPC) codes, are driving rapid progress in quantum computing. Oratomic's surprising research findings have had a visible impact on the industry, highlighting the importance of building stable and scalable quantum computers. These advancements are crucial because stable quantum computers can tackle complex problems, including those that threaten current encryption systems. Efficient quantum error correction, enabled by qLDPC codes, is essential for maintaining the integrity of quantum information during long computations, underscoring the growing quantum threat to existing cryptographic standards.