How close is a quantum computer to breaking encryption?

How soon could quantum computers break encryption?

Two new analyses suggest that a capable quantum computer capable of breaking widely used encryption schemes may be built sooner than previously estimated. The idea turns on the gap between what quantum hardware can do today and what’s required to run quantum algorithms at the scale needed for practical cryptanalysis.

What the new work focuses on

Earlier projections often assumed that a quantum computer would need very large numbers of physical qubits—along with significant overhead for error correction—before it could execute useful cryptanalytic workloads. The newer studies re-examine those assumptions, including how efficiently errors can be corrected and how many physical qubits are required to produce a single reliable logical qubit.

Why estimates changed

The coverage indicates the new analyses reduce the requirements compared with older assumptions. If error-correction overhead is lower than expected, then the “time to capability” could move closer. In simple terms: better understanding of resources and more optimistic (but still technical) pathways to scale can move the target from “far into the future” toward “within reach.”

Why this matters now

If quantum computers can eventually run algorithms that undermine public-key encryption, then organizations and governments need transition plans well ahead of any real-world cryptanalytic capability. That typically means moving to post-quantum cryptography—updating protocols to those designed to remain secure even against quantum attacks.

Bottom line

The key point is timing: while quantum threats remain speculative until a working machine exists at the required scale, the analyses argue the timeline may be earlier than many prior forecasts allowed. That strengthens the case for accelerating cryptographic migration planning rather than waiting for an announcement from quantum hardware labs.