Scientists have issued a warning that quantum computers may be closer to breaking the world's most secure encryption methods than previously anticipated. The required power level is estimated to be around 10,000 qubits, a drastic reduction from the millions widely assumed necessary. This development puts sensitive data, including banking details and private communications, at potential risk.

The Quantum Threat to Modern Cryptography

Quantum computers leverage qubits, which can run calculations in parallel, offering exponentially greater performance over sequential classical computers. This power is theoretically capable of solving problems intractable for current technology.

Shor's Algorithm and RSA Encryption

The benchmark for this threat is Shor's algorithm, developed by mathematician Peter Shor. This algorithm efficiently factors large numbers, forming the basis of RSA public-key encryption, which secures much of the internet's digital infrastructure.

Previously, it was thought that breaking RSA would require a quantum computer with millions of qubits. However, a new, un-peer-reviewed study uploaded on March 31 revises this estimate significantly downward.

The Role of Error Correction in Qubit Requirements

A major hurdle in quantum computing is the inherent 'noise' in qubits, leading to high error rates compared to classical bits. To combat this, researchers use logical qubits—collections of entangled physical qubits.

Traditional error-correction schemes demanded hundreds of physical qubits for every single logical qubit. The new research focuses on Quantum Error Correction (QEC) projects and novel architectures that drastically reduce this overhead.

Breakthroughs in Neutral-Atom Architectures

The study highlights neutral-atom quantum computers, which use charge-neutral atoms suspended by lasers and cooled to near absolute zero. These systems have shown promise in reducing the physical qubit requirement per logical qubit to as few as five.

Scientists noted that recent neutral-atom experiments have achieved universal fault-tolerant operations below the error-correction threshold. They stated, "Although substantial engineering challenges remain, our theoretical analysis indicates that an appropriately designed neutral-atom architecture could support quantum computation at cryptographically relevant scales."

New Projections for Cracking Encryption

The researchers analyzed the potency of quantum systems against three key algorithms: Shor's algorithm, ECC-256 (used for internet traffic and cryptocurrency), and RSA-2048.

  • Without error correction, cracking RSA in one week was projected to need 1 million qubits, while ECC would need 500,000 qubits in mere minutes.
  • Based on the new analysis incorporating error-correction improvements, Shor's algorithm could be solvable with just 11,961 qubits.
  • A system with 26,000 qubits could potentially crack RSA-2048 encryption in approximately seven months, according to the authors.

Call for Urgent Cryptographic Transition

The findings underscore the immediate need to transition widely deployed cryptographic systems to post-quantum standards. The scientists concluded, "This conclusion underscores the importance of ongoing efforts to transition widely-deployed cryptographic systems toward post-quantum standards designed to be secure against quantum attacks."

The study focused on current QEC methods, suggesting that future breakthroughs in physical qubit fidelity or algorithmic compression could further reduce the required qubit count for these security-breaking feats.