Breaking encryption with a quantum computer just got 10 times easier
New Scientist
February 25, 2026
AI-Generated Deep Dive Summary
Breaking encryption with a quantum computer has become significantly easier, according to recent advancements in quantum computing research. The RSA encryption algorithm, widely used for secure communications and online transactions, is now estimated to be crackable by a quantum computer with just 100,000 qubits—a tenfold reduction from previous estimates. This breakthrough makes the threat of quantum decryption more immediate, as researchers believe such machines could be built within the next decade.
The RSA algorithm relies on the mathematical difficulty of factoring large numbers into their prime components, a task that has long been considered intractable for classical computers. However, quantum computing poses a potential game-changer due to its ability to solve certain problems exponentially faster. In 2019, Google Quantum AI researcher Craig Gidney reduced the required qubits from 170 million to 20 million, and further advancements by Paul Webster at Iceberg Quantum have brought this number down to less than 100,000. These improvements are largely attributed to new methods like qLDPC (quantum Low-Density Parity-Check) codes, which enhance qubit connectivity and allow for more efficient computation.
The implications of these developments are significant. If a quantum computer with 98,000 superconducting qubits were operational, it could theoretically break RSA encryption in about a month. Even faster decryption would require only 471,000 qubits. While this represents a major step forward, practical
Verticals
science
Originally published on New Scientist on 2/25/2026