The Event
IBM, in collaboration with the University of Chicago, Algorithmiq, and Qedma, has completed a 70-logical-qubit demonstration on the Quantum Heron R3 superconducting system. The experiment executed 2,415 logical two-qubit gates and 468 logical T gates, with the entire task finishing in about 15 minutes—well beyond the reach of state-of-the-art classical simulation. The key innovation lies not in the qubit count but in the space-time code: error detection is embedded directly inside the circuit, allowing quantum results that surpass classical limits to be statistically verified for the first time. IBM's official announcement came on July 29, and the result was widely reported in early August by outlets such as Zhiding (CSDN/至顶科技) and NetEase, referencing arXiv preprints.
Why It Matters
First, it directly answers quantum computing's most awkward question: how do you prove you actually beat classical? Past quantum advantage experiments often devolved into disputes—outsiders could not verify whether the results were correct or whether classical shortcuts existed. The space-time code approach makes error detection part of the circuit itself, so outputs come with statistically quantifiable confidence. This breaks the deadlock of unprovable quantum advantage, a qualitative shift from "it ran" to "it ran and can be trusted."
Second, it complements rather than repeats recent quantum coverage. In August we covered Pasqal (AI agents autonomously running quantum experiments while confidently erring), HALO (compiler-based depth reduction with O(1) overhead instead of more qubits), Nord Quantique (bosonic GKP 1:1 encoding), and IBM's modular multi-chip cryogenic engineering. This installment fills in "how the error-correction layer grants credibility to results"—once logical qubits reach 70 and gate counts reach the thousands, an advantage that cannot be proven makes large scale just a pretty number.
Third, 15 minutes versus classical intractability suggests the window for practical advantage is narrowing. The 468 logical T gates are the hard currency of universal fault-tolerant quantum computing—running them stably means a programmable fault-tolerant machine is drawing nearer. Combined with IBM's Starling (2029) roadmap, the 70 logical qubits serve as a credible milestone for calibrating industry expectations of "when can we actually use this."
One-Line Takeaway
Quantum computing is no longer about who has more qubits, but whose victory can be proven—the space-time code turns the 70-logical-qubit advantage from a claim into a verifiable conclusion, a critical leap in engineering credibility.