Quantum advantage through trusted quantum computation | IBM Quantum Computing Blog<br>Sign in to PlatformSign in

Quantum Research<br>Blog

Researchers demonstrate quantum advantage through trusted quantum computation<br>Demonstration shows trusted quantum computation in regimes where classical methods fail.

Date<br>30 Jul 2026

Authors<br>Abhinav Kandala<br>Ali Javadi-Abhari<br>Jay Gambetta

Topics<br>Research<br>Error Correction & Mitigation<br>Algorithms

Share this blog

Key takeaways:

Three papers demonstrate quantum advantage with built-in validation, enabling trustworthy quantum computations beyond exact classical verification.

IBM and UChicago used doped Clifford sampling and spacetime codes to certify classically hard quantum computations.

Qedma, RIKEN, and BlueQubit observed quantum phenomena beyond leading classical simulations using validated error-mitigation techniques.

Algorithmiq demonstrated how trusted quantum results can emerge by validating the computation process rather than a classical answer.

The Quantum Advantage Tracker continues to pit quantum advantage claims against the best available classical methods.

Quantum computing is entering an era where beyond-classical results can be produced with rigorous evidence of reliability.

A quantum advantage occurs when a quantum computer performs a computation beyond what classical computing can achieve alone—and when the result can be rigorously validated. But this raises a fundamental question: how can we trust the output of a quantum computer when classical verification is no longer available?

Today, a trio of papers from researchers at UChicago, Qedma, and Algorithmiq in collaboration with IBM are reporting demonstrations of quantum advantage, based on frameworks designed to build trust in the quantum computation.

Since the emergence of quantum computing, we’ve always relied on a classical computer to validate the quantum computers’ outputs. As quantum computers began to produce results for problems beyond the limits of classical computation, arguments for the validity of the quantum computation always relied on problem instances that were smaller or simpler and extrapolating them to the complexity that classical methods could not reach.

However, these extrapolations do not fully validate the computation in the more complex "advantage" regime—the effects of noise or the propagation of errors can simply be very different.

These three papers represent only part of the ongoing work tracked in the Quantum Advantage Tracker. Today, submissions include candidates from Q-CTRL, BlueQubit, Birla Institute of Technology and Science, Pilani, and we expect the back-and-forth to continue as the community continues to benchmark.

A new way to verify random circuit sampling problems

Random circuit sampling (RCS) has become one of the leading demonstrations of quantum computational separation because carefully constructed random circuits rapidly become intractable for classical simulation. But this hardness also creates a verification problem.

Cross-entropy benchmarking (XEB) requires computing ideal output probabilities, which can become prohibitively expensive for the largest circuits. Earlier experiments therefore often relied on smaller or simplified circuits to infer the performance of circuits that could not be checked directly at full scale. While this provided a practical estimate of hardware performance, it remained a “proxy of a proxy” rather than a direct certification of the classically hard computation itself.

A new paper from researchers at IBM and UChicago addresses this verification gap using a structured alternative called doped Clifford sampling. The authors establish hardness guarantees under assumptions similar to those used for RCS, but crucially, the added structure can also detect errors during the computation.

The Clifford circuit is embedded in a spacetime code, whose detecting regions extend across both the qubits and the circuit’s evolution.

Spacetime codes use ancilla qubits distributed across both space and time to detect errors during a quantum computation. By post-selecting runs that satisfy these consistency checks, researchers can substantially improve the fidelity of logical operations. In this demonstration, a 70-logical-qubit computation achieved roughly a 10× reduction in effective gate error while maintaining practical execution rates.

The authors demonstrated the approach with a large T-doped circuit, in which non-Clifford T gates are strategically added to an otherwise efficiently simulable Clifford circuit. This makes the computation classically difficult while preserving the structure needed for error correction and validation.

The key innovation is that validation becomes part of the computational framework itself. The experiment begins with an encoded Clifford reference circuit, whose output can still be efficiently simulated classically to establish a trusted baseline. The hard computation is then created by strategically...