Quantum Computing Breakthroughs Bring Encryption Cracking Closer

Thirty years ago, Peter Shor revolutionized the field of quantum computing by demonstrating that quantum computers could solve complex mathematical problems that classical computers would take billions of years to crack. These problems underpin the security of our digital world. For decades, Shor's algorithm was merely a theoretical threat due to the enormous number of qubits required. However, recent advances by two research groups have significantly reduced these requirements, bringing the era of quantum computers closer than ever.

A team at Caltech has proposed a design for a quantum computer capable of breaking encryption with tens of thousands of qubits, forming a company named Oratomic to build it. Meanwhile, Google has developed a more efficient implementation of Shor's algorithm, making it ten times more efficient than previous methods. Although neither group has the hardware to crack encryption today, these developments suggest that powerful quantum computers may be just years away.

The Caltech team, led by Dolev Bluvstein and Madelyn Cain, focused on two major trends: the rise of neutral atom qubits and the advancement of error-correcting codes. Neutral atoms can be arranged flexibly, making them ideal for quantum low-density parity-check (qLDPC) codes, which require fewer real qubits to create virtual ones. Collaborating with experts, the team developed a highly efficient qLDPC code, enabling significant reductions in the number of qubits needed.

Simulations showed that a quantum computer with 10,000 atoms could break RSA encryption in a century, while 100,000 atoms could do it in three months. Google, on the other hand, has made strides in breaking elliptic curve cryptography (ECC) with fewer than 500,000 qubits, highlighting the rapid progress in the field.

As quantum computing advances, there's an urgent need to transition to new cryptographic schemes that quantum computers cannot break. The U.S. government plans to switch to these new codes by 2035, but some experts argue for a faster transition.

Despite the optimism, challenges remain. The Caltech team's ambitious projections rely on unproven error correction steps and mechanical expectations. Yet, they remain undeterred, viewing the construction of a quantum computer as a monumental quest.

If successful, these developments could mark the end of the 'Noisy Intermediate Scale Quantum' era and usher in a new 'fault-tolerant' era. Researchers are eager to explore the potential of quantum computers beyond cryptography, including applications in machine learning and understanding the quantum nature of space-time.