Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum computational advantage in random-circuit sampling on IBM superconducting quantum computers

Published 23 Sep 2026 in quant-ph | (2609.28657v1)

Abstract: We report forward random-circuit sampling (RCS) on the 120-qubit Nighthawk r2 superconducting processor (\textit{ibm_phoenix}) with square-lattice connectivity, using 61 qubits, native CZ gates, and the standard cloud execution stack with no benchmark-specific calibration. Two independent fidelity estimators---mirror benchmarking and three- and four-patch cross-entropy benchmarking (XEB)---agree with each other at every measured depth, the mirror from 4 to 40 cycles and the patched estimators from 20 to 40 cycles, across more than two orders of magnitude of fidelity decay, and exceed the first-generation Nighthawk r1 device by more than an order of magnitude at fixed depth. The 36-cycle circuits sit at the depth where tensor-network contraction cost saturates at system size: a contraction-cost estimator validated against the published Sycamore and Zuchongzhi networks places the single-amplitude cost at ∼\sim10{22}</sup>complexoperations.At</sup> complex operations. At F_{\mathrm{XEB}}(36)=2.3\times10{-3}</sup>underfavorablememoryassumptionsthisimplies</sup> under favorable memory assumptions this implies 1.2\times10{27}</sup>machineoperationswithinthebounded−fidelityrejection−samplingmodel−−−morethanacenturyofruntimeontheFrontiersupercomputer−−−tocollecta</sup> machine operations within the bounded-fidelity rejection-sampling model --- more than a century of runtime on the Frontier supercomputer --- to collect a 10{6}$-sample ensemble, which takes only 19\,s on Nighthawk r2. To our knowledge, this is the first demonstration of quantum advantage for a vanilla random-circuit sampling on a commercially and broadly accessible quantum processor that most non-expert quantum computer users can easily replicate.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.