Quantum Computers Just Crossed a Dangerous Threshold

What happens when the mathematics protecting the internet meets a machine that could eventually defeat it? Every secure website depends on cryptography, but some of the public-key systems behind digital trust have a vulnerability that no ordinary computer can realistically exploit. Peter Shor showed in 1994 that a sufficiently large, fault-tolerant quantum computer could solve the mathematical problems protecting RSA and widely used elliptic-curve cryptography. No quantum computer today can break RSA-2048. So why is the world already racing to replace its digital locks?

In this science and technology documentary, we investigate how close quantum hardware really is to cryptographic relevance. We explore Shor's algorithm, why quantum interference matters more than the myth of trying every answer at once, and the enormous difference between physical qubits and reliable logical qubits. Google's Willow processor demonstrated below-threshold quantum error correction, and research in 2026 showed how adaptive control can improve logical stability. These are meaningful engineering breakthroughs, but they are not demonstrations of quantum code-breaking.

The scale of the challenge is staggering. A 2019 estimate put a possible RSA-2048 attack at around 20 million noisy physical qubits under specific assumptions. A 2025 study by Craig Gidney reduced the modeled requirement to fewer than one million, with a runtime under a week. Neither estimate describes a machine that has actually been built. Logical gates, magic-state factories, real-time decoding, correlated errors and long-term stability remain major obstacles. There is no verified countdown to Q-day.

But waiting for a working attack may already be too late for secrets that must stay private for decades. In a harvest-now-decrypt-later scenario, an adversary could record certain vulnerable encrypted communications today and attempt to decrypt them with a future quantum computer. Digital signatures face a different threat: future key recovery could allow impersonation or forgery. That does not mean every password, AES-encrypted file or secure connection will instantly fail. The risks depend on the algorithms, keys and protocols involved.