IBM and University of Chicago Demonstrate Verifiable Quantum Advantage with 70 Logical Qubits

On July 30, 2026, IBM and the University of Chicago jointly announced a quantum computing demonstration that for the first time satisfies the two hardest-to-combine criteria in quantum advantage (quantum supremacy) experiments over the past decade:

1. Computational results beyond the practical capability of the strongest known classical simulation methods 2. A statistical confidence proof that "this result is trustworthy, not because we got lucky"

They used 70 logical qubits on IBM's Heron processor, with 2,415 logical two-qubit gates and 468 logical T gates, achieving a result of "fidelity lower bound 0.284 + 95% confidence + 10× error-rate suppression." The full computation took about 15 minutes — a classical simulation of equivalent scale would require an "impractical" runtime under the strongest known algorithms.

The paper was posted to arXiv on July 30 as a preprint titled "Sampling hard circuits with verifiably high fidelity" (arXiv:2607.25941). IEEE Spectrum quickly reported on it, stating that "the 95% confidence guarantee is something no previous approach could do."

Why This Is a Watershed Moment

Since Google first demonstrated quantum advantage with Random Circuit Sampling (RCS) in 2019, the concept has been stuck on one problem: how do you know what you're seeing isn't just noise?

RCS works by having a quantum processor run random gate sequences to produce extremely complex outputs that classical computers cannot reproduce. If classical simulation fails, quantum is declared the winner.

But if even classical computers can't simulate it, how do you prove the quantum device didn't "coincidentally spit out strings that look complex but are actually noise"? Over the past 7 years, classical algorithms have steadily caught up with Google's 2019 demonstration, generating narratives that "quantum advantage wasn't that big after all."

The IBM + Chicago solution this time wasn't "write even more complex circuits," but making the circuit structure itself "verifiable":

• Constructing circuits using a method called a "spacetime code"
• Primarily using Clifford gates (which classical computers can simulate efficiently)
• Adding some "non-Clifford gates" (which make classical simulation complexity grow exponentially)
• Crucially, this structure allows "detecting errors and discarding failed runs" during the computation

The result: classical simulation difficulty rises exponentially, while the quantum side can continuously detect failures, discard them, and retry. Retained runs come with a fidelity lower bound at 95% confidence.

Jay Gambetta, Director of IBM Research and IBM Fellow, made a widely quoted statement:

> "We are already in the era of quantum advantage. We have demonstrated a quantum computation beyond the practical capability of classical computing, with a statistical confidence bound on the execution fidelity. This provides a foundation of trust for researchers, developers, and enterprises looking to use quantum systems for problems classical computing cannot reach."

The Data Backbone

• Processor: IBM Heron (tunable-coupler architecture first released in 2023)
• Qubits: 70 logical qubits (not physical qubits — the distinction is that "logical qubits" carry error correction)
• Operations: 2,415 logical two-qubit gates + 468 logical T gates
• Runtime: ~15 minutes
• Fidelity lower bound: 0.284 (95% confidence)
• Error-rate suppression: 10× via syndrome post-selection
• Classical simulation equivalent time: "impractical" (specific multiple not disclosed, but IEEE Spectrum reported the 95% confidence cost required 860× more runs to offset the discard rate)
• Paper: arXiv:2607.25941, Simon Martiel et al., 9 authors
• Publication date: Posted to arXiv July 30, 2026, with journal submission to follow

Why the "Verification Problem" Went Unsolved for a Decade

Quantum gates fall into two categories:

• Clifford gates: classically simulable efficiently
• Non-Clifford gates: classical simulation complexity grows exponentially with their number

Google's 2019 RCS demonstration used many Clifford gates plus a few non-Clifford gates — this pushed classical simulation costs to exponential levels, but simultaneously made verification impossible. If you can't even compute it yourself, on what basis do you claim the result is correct?

The key to IBM + Chicago's approach: many Clifford gates, few non-Clifford gates, but with spacetime code structure added. This means:

• Classical simulation remains hard (non-Clifford gates are still present)
• The computation can self-check (many Clifford gates allow the spacetime code to detect errors)
• Failed runs are discarded; only retained runs count toward the result

The cost: the error-detection overhead is so large that the actual number of runs needed is 860× the unverified version. But the payoff is a "trustworthy result" at 95% confidence.

The Key Questions Ahead

The "verification problem" has been the most criticized dilemma in quantum computing over the past decade — the inability to prove you're right. After Google's 2019 demonstration, classical algorithms kept catching up, and "the quantum advantage wall" was repeatedly pushed lower.

This time, IBM + Chicago delivered a "credible version of quantum advantage," which means:

• Classical challengers can no longer easily claim to have caught up — with 95% confidence, classical catch-up becomes far harder
• Quantum advantage now has the engineering properties of being quotable, reproducible, and challengeable
• In the subsequent phase of finding applications, publishing papers, and negotiating commercial contracts, quantum computing results now have verification backing

In the short term, IBM's own roadmap calls for porting this "logical qubit + spacetime code" design to the next-generation Kookaburra processor. In the medium term, partners Algorithmiq and Qedma, two quantum software companies, will continue pushing this "verifiable" approach to mid-scale NISQ systems. Long term, US Department of Energy national laboratories will begin integrating this methodology into quantum + AI + classical hybrid computing workflows.

Why This Matters More Than "IBM Showing Off Quantum Advantage Again"

For the past decade, "quantum advantage" has been a somewhat self-certifying, demonstration-style proposition — you couldn't prove your demonstration was credible, so classical algorithms kept catching up, and you kept "redefining the boundary."

What IBM + Chicago delivered this time isn't "quantum advantage with bigger numbers," but "quantum advantage with statistical confidence." It moves quantum computing from "demonstration" to "verifiable task."

For the industry specifically:

• Classical supercomputing center operators can use this paper as the answer to "why the quantum part isn't just for show"
• R&D leaders in pharma, logistics, batteries, AI, and other industries can start seriously evaluating "should we try doing something real with quantum"
• Hybrid "quantum + AI + classical" computing centers like the US Department of Energy, Argonne National Laboratory, and Oak Ridge National Laboratory can consider integrating this verification methodology into their workflows

One final cold statistic: simulating the equivalent problem classically under "the strongest practical classical simulation algorithms" requires an "impractical runtime." The specific figure behind "impractical" hasn't been disclosed, because it is astronomical even on IBM's best classical simulation hardware.

But IEEE Spectrum made a key observation: "A single complete run of this experiment took 15 minutes, which strips any classical simulation of commercial meaning."

In other words: this is the first time in a decade that a quantum advantage demonstration leaves classical competitors with no room to say "just wait, I'll write another algorithm and catch up." The only remaining concern was "prove the result is correct" — and the 95% confidence bound solves exactly that too.

---

• Sources: IBM Research press release (July 30), IEEE Spectrum detailed report (early August), phys.org technical review (August 1), Machine Herald retrospective commentary (August 5)
• First principles: 70 logical qubits + 2,415 two-qubit gates + 468 T gates + spacetime code + syndrome post-selection
• Key figures: Fidelity lower bound 0.284 / 95% confidence / 860× run-count cost
• Historical significance: First time quantum computing has been simultaneously validated on both "credibility" and "beyond-classical" dimensions
• International coverage: Independently cross-confirmed by IEEE Spectrum / phys.org / Machine Herald / IBM press release