IBM Quantum Computer Solves Classically Intractable Problem in 15 Minutes
ScienceDaily, Monday, September 7th, 2026
IBM and UChicago used 70 logical qubits to run a verifiable computation beyond classical reach in about 15 minutes.
IBM and University of Chicago researchers report a quantum computation meeting key criteria for quantum advantage, described in the paper "Sampling hard circuits with verifiably high fidelity."
They designed a structured alternative to random circuit sampling that stays classically hard while allowing errors to be detected, addressing the verification problem.
The experiment used 70 error-corrected logical qubits, 2,415 logical two-qubit operations and 468 T gates, with logical error rates 10 times lower than physical rates. It finished in about 15 minutes, while leading classical methods faced prohibitive runtimes.