IBM and University of Chicago Achieve Verified Quantum Advantage: First Computation with Mathematically Guaranteed Correctness

On July 30, 2026, IBM and the University of Chicago announced a landmark achievement in quantum computing: they demonstrated "verified quantum advantage" by performing a computation beyond the practical reach of classical supercomputers while simultaneously providing statistical proof that the result was correct. The work, detailed in the preprint "Sampling hard circuits with verifiably high fidelity," solves a long-standing verification problem that has plagued the field since the first quantum advantage claims .

What Is Verified Quantum Advantage?

Quantum advantage refers to the point at which a quantum computer can solve a problem that no classical computer can solve in a practical amount of time. The challenge has always been trust: with classical computers, you can check your work; with quantum computers, verifying the output of a fundamentally probabilistic machine is enormously difficult. IBM and the University of Chicago claim to have cracked this problem by building a circuit that is both hard for classical computers to simulate and structured enough to verify its own accuracy .

Technical Details: 70 Logical Qubits on a Heron Processor

The flagship experiment ran on an IBM Quantum Heron processor and achieved several notable metrics :

• 70 logical qubits were encoded using a new error-correction method, representing one of the largest fault-tolerant logical qubit demonstrations ever reported.
• The circuit executed 2,415 logical two-qubit operations and 468 logical T gates, standard metrics for quantifying computational complexity.
• The computation completed in approximately 15 minutes — a task the team said would require impractical amounts of time using leading classical simulation methods.
• The logical error rate was suppressed to about 10 times lower than the physical error rate of the underlying qubits .

The problem itself was a sampling task designed to be classically hard while remaining amenable to verification. The team released both the circuits and the results publicly on IBM's Quantum Advantage Tracker and explicitly invited independent challenge and refutation from the broader research community .

The Verification Breakthrough: The Spacetime Code

The core innovation behind the verified result is a technique called a "spacetime code," a structured alternative to the random circuit sampling (RCS) approach used in earlier quantum advantage experiments .

• The researchers built the circuit primarily from Clifford gates, a subset of quantum gates that are efficient to simulate classically and naturally support error detection.
• They then carefully grafted T gates — the non-Clifford operations essential for universal quantum computation — into specific positions within the circuit that preserved the error-detection capability of the Clifford framework .
• This design allowed the system to detect errors during the computation itself, rather than relying on classical verification after the fact .

The team calculated a lower bound on fidelity of 0.284 with 95% statistical confidence — the first time a quantum advantage experiment has produced mathematically guaranteed correctness bounds .

There was a significant trade-off for this verification: the total number of experimental runs ballooned to 860 times the normal amount, and only about 28% of runs passed the error-detection filter . This overhead represents a major engineering challenge for scaling to practical applications.

Broader Context: Three Papers, One Announcement

The July 30 announcement coordinated three separate preprints posted to arXiv on July 27–28, each using a different method to build confidence in quantum computations beyond classical simulation .

• IBM + University of Chicago: The flagship logical-circuit result described above.
• IBM + Qedma Quantum Computing: Used Qedma's QESEM error-mitigation software to observe long-lived dynamics on up to 74 qubits, comparing results with classical simulations from RIKEN and BlueQubit and hardware checks on Quantinuum .
• IBM + Algorithmiq: Demonstrated quantum advantage in simulating a heterogeneous quantum material, a problem that had been open on the Quantum Advantage Tracker for eight months .

External researchers noted that the Qedma and Algorithmiq companion papers did not explicitly claim quantum advantage themselves, but rather stated that they had shown classical simulation is difficult . All three papers are preprints that have not yet undergone peer review .

Skepticism and Caveats

As with any major quantum computing claim, skepticism is warranted. Longtime quantum computing critic Gil Kalai has argued that noise could still undermine the results . The 860× overhead for error detection is a significant practical limitation, and scaling the approach to problems of real-world commercial interest remains a major open challenge . IBM has responded by making its data and methods fully public, explicitly inviting independent challenge .

CEO Arvind Krishna: Financial Projections and Investment Plans

On the same day as the technical announcement, IBM CEO Arvind Krishna appeared on CNBC's "Mad Money" to discuss the commercial implications .

• Krishna said quantum computing will have a "measurable impact" on IBM's top line and bottom line by 2028 or 2029 .
• He stated that IBM is "pretty convinced" quantum computing could create a trillion dollars of value by the end of the 2030s .

These projections are backed by substantial investment. IBM announced in June 2026 that it plans to invest over $10 billion in quantum computing over the next five years, covering research and development, hardware manufacturing, error correction, software, and ecosystem partnerships . The company remains on track to deliver a large-scale fault-tolerant quantum computer by 2029 .

A planned standalone quantum chip foundry is being partially supported by a $1 billion commitment from the U.S. Department of Commerce .

What It Means

If the results survive peer review, this would be the most credible evidence yet that quantum hardware has crossed a meaningful utility threshold. The combination of a classically hard computation with statistically guaranteed correctness addresses the central trust problem that has shadowed every quantum advantage claim since Google's 2019 Sycamore experiment. The caveats are real — the overhead is enormous, the problem was specifically chosen to be verifiable, and the papers are still preprints — but the direction of travel is clear: quantum computing is moving from proof-of-concept toward verifiable, trustworthy computation.