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

arXiv:2609.28657 · quant-ph · Submitted 2026-09-23 · Read on arXiv

quant-ph

Submitted: 2026-09-23

Updated: 2026-09-23

Terminology

• Fidelity — 47× in this paper · explained in 2 episodes
• Benchmark — 16× in this paper · explained in 2 episodes
• Calibration — 15× in this paper · explained in 7 episodes
• Quantum Circuits — 11× in this paper · explained in 2 episodes
• Benchmarking — 10× in this paper · explained in 4 episodes
• Verification — 8× in this paper · explained in 2 episodes
• Core — 3× in this paper · explained in 2 episodes
• Anticoncentration — 2× in this paper · explained in 1 episode
• Consistency — 2× in this paper · explained in 3 episodes
• Phase Transitions — 1× in this paper · explained in 2 episodes
• Pruning — 1× in this paper · explained in 4 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• Simulation of low-depth quantum circuits as complex undirected graphical models
• Classical Simulation of Intermediate-Size Quantum Circuits
• Classical Simulation of Quantum Supremacy Circuits
• Classical Sampling of Random Quantum Circuits with Bounded Fidelity
• A sharp phase transition in linear cross-entropy benchmarking
• Quantum computing with Qiskit
• Theory of mirror benchmarking and demonstration on a quantum computer

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity