IBM Claims ‘Trusted Quantum Advantage’ With Three Simultaneous Papers. Here’s What the Numbers Actually Show.

Table of Contents

July 30, 2026 – IBM coordinated the public announcement of three preprints posted to arXiv on July 27 and 28, each using a different method to build confidence in quantum computations beyond reliable classical simulation. IBM presented all three as evidence that quantum computing had entered “the quantum advantage era.”

The verification techniques are a genuine step forward. The “era” framing deserves a closer look.

IBM released three papers, each addressing the same fundamental problem from a different direction: how do you trust a quantum computer’s output when no classical machine can check the answer?

The flagship result came from IBM and the University of Chicago. In a preprint posted to arXiv on July 28, researchers Simon Martiel, Ali Javadi-Abhari, Bill Fefferman (UChicago), Jay Gambetta, and collaborators demonstrated what they call “doped Clifford sampling,” a structured alternative to the random circuit sampling (RCS) approach that Google used for its contested 2019 quantum supremacy claim.

The core idea: build a quantum circuit entirely from Clifford gates (which classical computers can simulate efficiently), embed the circuit in a “spacetime code” that detects errors across both qubits and time steps, then strategically inject non-Clifford T gates to push the computation beyond classical reach. Because the T gates are added in places that preserve the error-detection structure, the circuit carries its own fidelity certificate. The experiment ran a depth-70 circuit on 70 data qubits, augmented by 27 syndrome ancillas for 97 physical qubits total. The physical circuit contained 2,869 CZ gates (2,415 in…

添加评论
点赞收藏
点踩分享查看原文
评论
?
参与讨论