Quantum Computers Threaten Encryption Sooner Than Expected

The digital security protecting everything from bank accounts to cryptocurrency wallets now faces a dramatically accelerated timeline for obsolescence. Two separate research advances from Caltech and Google have substantially reduced the quantum computing power needed to break modern encryption, suggesting that what was once considered a distant threat may arrive within years rather than decades. According to Nikolas Breuckmann, a mathematical physicist at the University of Bristol, 'If you care about privacy or you have secrets, then you better start looking for alternatives.' These developments signal that the era of quantum-resistant cryptography must begin immediately, not as a future contingency.

The Caltech team, led by physicists Dolev Bluvstein and Madelyn Cain, designed a quantum computer that could break encryption with only tens of thousands of qubits—a massive reduction from previous estimates of millions or billions. Simultaneously, Google researchers led by Craig Gidney developed an implementation of Shor's algorithm that is ten times more efficient than previous s for breaking elliptic curve cryptography. Neither group currently possesses the hardware to execute these attacks, but their theoretical advances demonstrate that powerful quantum computers capable of undermining current security protocols are becoming increasingly plausible on shorter timescales.

To achieve their breakthrough, the Caltech researchers combined two emerging quantum technologies: neutral atom qubits and advanced error correction codes. Neutral atoms offer flexibility because physicists can manipulate and reposition them using laser beams, unlike fixed superconducting qubits. This mobility proved crucial for implementing quantum low-density parity-check (qLDPC) codes, which dramatically reduce the number of physical qubits needed to create reliable virtual qubits. The team faced of finding a qLDPC code that balanced efficiency with error tolerance, a task they approached with mathematical precision and computational assistance.

Robert Huang, a quantum theory expert on the Caltech team, employed a large language model designed by mathematicians to optimize their qLDPC code. The AI-generated code proved remarkably efficient, requiring only four atoms to create one virtual qubit while withstanding 20 to 24 catastrophic errors—a significant improvement over earlier codes that needed 12 atoms per virtual qubit with less error tolerance. With this optimized code and decoder, the team simulated their design running Shor's algorithm against RSA and elliptic curve cryptography. Their simulations showed that 10,000 atoms could break common RSA encryption in about a century, while 100,000 atoms could accomplish the same task in just three months.

Google's parallel advancement focused on algorithmic efficiency rather than hardware design. Gidney's team developed a new quantum procedure specifically for breaking elliptic curve cryptography that requires at least ten times fewer resources than previous s. They estimate that most cryptocurrencies could be compromised in minutes by a machine with fewer than 500,000 qubits. Jeff Thompson, a physicist at Princeton University, noted that 'That tenfold reduction in the actual space-time cost of elliptic curve code breaking is hugely significant.' Both advances indicate that smaller quantum computers will achieve cryptographic breakthroughs sooner than many researchers anticipated.

The practical are immediate and urgent. The National Institute of Standards and Technology published new quantum-resistant cryptographic standards in 2024, and the U.S. government plans to transition completely to these new codes by 2035. However, Google has announced it aims to stop relying on vulnerable encryption by 2029, and Thompson warns that 'If you were thinking about when you were going to do a post-quantum crypto transition, you should not be waiting any longer. This is the time to do it.' The research also marks a security-conscious turning point, with Google using zero-knowledge proofs to describe their work without revealing sensitive implementation details.

Despite the promising simulations, significant engineering s remain. External researchers have raised questions about the Caltech team's assumptions, particularly regarding error correction speeds and operational cadences. The team claims their machine could perform complete error correction cycles every millisecond and maintain this pace for days or weeks during computations—a feat no existing system has achieved. Mark Saffman, a physicist at the University of Wisconsin-Madison, suggests that 'Id like to see a demonstration on a smaller scale, say, 100 or 1,000 qubits. Show me that you can do a million rounds or something.' The Caltech researchers acknowledge their ambitious timeline but remain optimistic about overcoming technical hurdles.

Beyond cryptography, the researchers envision broader scientific applications for fault-tolerant quantum computers. Bluvstein has formed a company called Oratomic to build the proposed machine, while Huang plans to use such devices for accelerating machine learning and exploring quantum physics. John Preskill, the Caltech theoretical physicist who advised the team, wants to simulate the quantum nature of space-time. As Quanta Magazine reports, building these machines will mark the end of the 'Noisy Intermediate Scale Quantum' era and open new frontiers in quantum exploration. The race to achieve practical quantum advantage has clearly entered a more urgent phase, with security and scientific that will reshape multiple fields in the coming years.