Key Takeaways:
Three separate demonstrations show quantum computers outperforming leading classical methods while producing results that can be independently verified — a milestone that brings quantum computing closer to challenging current cryptographic standards, including those securing Bitcoin.
IBM and three partners — Qedma Quantum Computing, the University of Chicago, and Algorithmiq — published results Thursday showing quantum computers solving problems beyond the reach of classical supercomputers, with built-in mechanisms to trust the output. The studies, released simultaneously on arXiv and the Quantum Advantage Tracker, mark the first time commercially available quantum hardware has achieved what researchers call "trusted quantum advantage."
"Trusted computing when you can do classical simulations is irrelevant. Trusted computing when you can't do classical simulations is a big deal," Jay Gambetta, director of IBM Research and an IBM Fellow, told Ars Technica.
Three Paths to Advantage
The Qedma collaboration used IBM's Heron processor to model a two-dimensional Floquet Ising system — a grid of simulated magnets whose orientations oscillate under periodic external pulses — across 74 qubits. The team worked with RIKEN, Japan's national research institute, to run two different classical algorithms on Fugaku, one of the world's most powerful supercomputers. The classical methods produced conflicting predictions: one showed net magnetism decreasing smoothly, the other showed it increasing. The error-mitigated quantum results, powered by Qedma's QESEM software, revealed a third behavior — gradual magnetic decay with periodic oscillations — that remained consistent when independently validated on Quantinuum's trapped-ion hardware.
The University of Chicago collaboration took a different approach, encoding 70 logical qubits with error correction to run 2,415 logical two-qubit operations and 468 T gates — a metric that measures circuit complexity. The logical computation achieved effective error rates 10 times lower than the physical error rates, enabling high-fidelity results. The quantum computation finished in approximately 15 minutes, a task the team said would demand infeasible amounts of time with leading classical methods. The researchers structured the circuit so that gentle measurements on peripheral qubits could detect errors during execution, discarding corrupted results.
Algorithmiq's demonstration simulated heterogeneous quantum matter — a model of how information flows through materials with irregular structures, relevant to catalysts and battery electrolytes. The problem has remained on the Quantum Advantage Tracker for eight months without any classical method producing reliable results across the full problem regime. Algorithmiq also released monoprop, an open-source package that lets any research group stress-test future quantum advantage claims using the same classical techniques the company used to challenge its own results.
Why Trust Matters
The core challenge these studies address is verification. When a quantum computer solves a problem that no classical computer can, there is no independent way to check whether the answer is correct. Each team developed a different solution: Qedma cross-validated across hardware platforms; the UChicago team used error-detecting qubits; Algorithmiq manipulated noise levels deliberately, showing that results remained stable even when device conditions changed.
"Quantum computers have reached the point at which they can show evidence of the fundamental criteria for advantage: they can outperform leading classical methods, and they can simultaneously produce results that we can trust," Gambetta said.
The Bitcoin Question
The advance has direct implications for cryptocurrency security. Bitcoin's elliptic curve digital signature algorithm (ECDSA) relies on the computational difficulty of discrete logarithm problems — a class of problems that Shor's algorithm, running on a sufficiently large quantum computer, could solve efficiently. If an attacker could derive private keys from public keys, the entire Bitcoin ledger would be vulnerable.
Practical exploitation remains years away. The demonstrations used 70-74 qubits for specialized physics simulations, not the thousands of high-quality logical qubits needed to run Shor's algorithm against Bitcoin's secp256k1 curve. But the trajectory is clear: IBM has shown that error-mitigated quantum computers can produce trusted results at scales where classical verification fails, and the company has published a roadmap to reach 100,000 qubits by 2033.
Investment Implications
For investors, the milestone signals that quantum computing is transitioning from theoretical promise to practical capability, even if commercial applications remain distant. Companies with exposure to post-quantum cryptography — including IBM itself, which has developed quantum-safe cryptographic standards — could see increased demand as enterprises begin migrating away from vulnerable encryption. Conversely, any acceleration in the quantum timeline would pressure Bitcoin and other cryptocurrencies that have not yet adopted quantum-resistant signatures.
IBM shares, trading at roughly 22 times forward earnings, have not yet priced in a quantum-driven disruption to crypto markets. The three studies are open for community benchmarking on the Quantum Advantage Tracker, where classical algorithm developers can attempt to match the quantum results — a process that has previously narrowed claimed advantages in earlier demonstrations.
This article is for informational purposes only and does not constitute investment advice.
