Two recent studies suggest that quantum computers could be capable of breaking modern cryptographic schemes sooner than anticipated. These works address key challenges in building fault-tolerant quantum machines and in optimizing algorithms for attacking public-key systems, such as RSA and elliptic curve cryptography, which are the foundation of internet security and digital transactions.

The findings focus on improving the efficiency of quantum algorithms and reducing hardware requirements. Traditionally, it has been estimated that millions of physical qubits would be needed to build a quantum computer capable of executing Shor's algorithm, which can factor large numbers and thus break RSA. However, these new analyses explore ways to drastically decrease the number of qubits required, either by optimizing the quantum architecture or implementing more efficient error correction techniques.

Although we are still far from having quantum computers that can execute Shor's algorithm at scale, these advances underscore the urgency of developing and adopting post-quantum cryptography. The scientific community and security agencies are already working on new cryptographic standards that are resistant to both classical and quantum attacks, anticipating the eventual arrival of quantum machines with the ability to compromise current information security.