IBM, in collaboration with researchers at the University of Chicago, says it has demonstrated what it calls "trusted quantum advantage," claiming a quantum computer completed a computation beyond the reach of leading classical simulation methods while also providing statistical evidence that the result was accurate.

The milestone adds to a growing body of research aimed at overcoming one of quantum computing's biggest obstacles: reliably correcting errors while scaling to larger systems. While the advance marks another step in IBM's quantum roadmap, the hardware remains well below what is believed necessary to threaten Bitcoin.

Quantum advantage refers to any milestone where a quantum computer solves a practical problem faster, cheaper, or more efficiently than the best possible classical computer. Previous claims of quantum advantage, including Google's widely publicized 2019 "quantum supremacy" experiment with its 53-qubit Sycamore processor, drew criticism over whether the tasks performed were genuinely useful or whether classical methods could eventually replicate the results. IBM itself disputed Google's 2019 claim, publishing a paper arguing the same computation could be simulated on a classical supercomputer.

"We are now firmly in the quantum advantage era," Jay Gambetta, Director of IBM Research and IBM Fellow, said in a statement. "This milestone gives scientists, developers, and businesses a new foundation for trusting quantum computers as they scale to problems far beyond what we can achieve classically."

In its latest announcement, IBM said researchers encoded 70 logical qubits using a new error-correction technique, completing a computation in roughly 15 minutes that the company says would require impractical amounts of time using today's leading classical simulation methods. The experiment executed 2,415 logical two-qubit operations and 468 logical T gates, while reducing logical error rates to approximately one-tenth of the underlying physical error rate.

IBM also said the experiment addresses a longstanding criticism of quantum advantage demonstrations: verification. Instead of relying on traditional random circuit sampling, the researchers developed a structured alternative that allows errors to be detected during computation while preserving the mathematical difficulty of the problem. The verification question is central to the credibility of quantum advantage claims across the industry, where companies including Google, Microsoft, IonQ, and Quantinuum are all racing to demonstrate reliable quantum speedups.

"Verification remains one of the biggest challenges in firmly establishing experimental quantum advantage," said Bill Fefferman, Associate Professor at the University of Chicago. "This experiment develops techniques to better characterize the fidelity of hard quantum states under noise, increasing confidence that the quantum computer is solving a computationally hard problem."

The announcement follows several milestones IBM laid out in its Starling roadmap, released last June. The roadmap targets a large-scale fault-tolerant quantum computer by 2029 and calls for verified quantum advantage demonstrations before scaling to modular processors and, ultimately, a system capable of roughly 200 logical qubits and 100 million quantum operations. Achieving that scale would require substantial advances in qubit fidelity, connectivity, and control systems—areas where the entire field still faces open engineering challenges.

Over the past year, IBM has continued building toward those goals. In October 2025, researchers demonstrated a 120-qubit GHZ "cat state," followed a month later by the introduction of its 120-qubit Nighthawk processor and experimental Loon chip, both designed to advance fault-tolerant computing. Earlier this year, the company expanded public access to more advanced quantum hardware, giving researchers additional time to develop algorithms and error-correction techniques.

For Bitcoin, the latest experiment is better viewed as an incremental technical advance toward "Q-Day" than a meaningful shift in the threat landscape. Bitcoin relies on elliptic curve cryptography for digital signatures, and researchers generally estimate that breaking the network's encryption would require thousands of logical qubits operating on a fault-tolerant quantum computer—far beyond the 70 logical qubits demonstrated in IBM's latest experiment. A theoretically viable quantum attack on Bitcoin's cryptography would rely on Shor's algorithm, but executing it at scale would demand not just thousands of logical qubits but also sustained error correction across deep circuits, a capability no quantum hardware platform has yet demonstrated.