Quantum Computing and Q Day: New Research Shrinks the Timeline for Breaking Today’s Encryption
Online security still relies heavily on encryption methods designed for classical computers, with the assumption that cracking modern keys would take impractically long.
That long-standing comfort is being challenged by fresh estimates suggesting quantum computers may need fewer resources to break widely used cryptography than previously thought.
The shift is driven by progress on two tracks at once: the steady march toward larger, more reliable quantum hardware and a wave of refinements in quantum algorithms. Together, they are tightening forecasts for the moment sometimes called Q Day, when quantum attacks could realistically defeat common public-key systems.
Why the estimates are changing
Much of today’s internet security depends on schemes such as RSA and elliptic-curve cryptography, the latter widely used in secure connections and cryptocurrency systems. Shor’s algorithm, proposed in 1994, showed in principle that sufficiently capable quantum machines could factor large numbers and solve related problems far faster than classical computers.
For years, practical attacks looked distant because they appeared to require millions of physical qubits once error correction and real-world noise were considered. Recent analyses, including work from Google’s Quantum AI group on attacking elliptic-curve systems, argue the requirements could be far lower, though still beyond current machines.
The quantum hardware race accelerates
Companies including IBM and Google are scaling up quantum processors while also working on software, error correction and system design needed for sustained, fault-tolerant operation. IBM has laid out timelines aimed at demonstrating quantum advantage in targeted tasks and progressing toward fault-tolerant systems later this decade.
Other approaches, such as neutral-atom and photonic platforms, are also advancing rapidly in laboratory demonstrations. While qubit counts alone do not equal cryptographic capability, larger and better-controlled systems can reduce the distance to practical implementations of code-breaking algorithms.
Post-quantum security moves from theory
Governments and standards bodies are increasingly treating post-quantum cryptography as a migration problem, not a research topic. In the US, NIST has been publishing guidance and transition planning for moving away from algorithms considered vulnerable to future quantum attacks, with broad migration targets extending into the 2030s.
Major technology firms have begun deploying post-quantum protections in limited or hybrid configurations to gain experience before full cutovers. Security experts also warn that data stolen today could be stored and decrypted later, raising the stakes for organisations protecting long-lived secrets.
Despite the accelerating research, there is no sign that quantum computers can break mainstream encryption at scale today. But the trend lines are clear: as algorithms improve and hardware matures, the prudent response is to inventory where vulnerable cryptography is used and begin staged upgrades to quantum-resistant alternatives.
