TL;DR
This paper investigates the potential for near-term quantum devices without error correction to achieve quantum supremacy by sampling from complex quantum circuit distributions, supported by extensive simulations and new benchmarking methods.
Contribution
It extends complexity theory to argue that classical simulation of such quantum sampling tasks is exponentially hard and introduces cross entropy as a practical benchmark for quantum supremacy.
Findings
Simulations with up to 42 qubits approach quantum supremacy.
Cross entropy effectively benchmarks quantum circuit fidelity.
Quantum supremacy feasible with approximately fifty superconducting qubits.
Abstract
A critical question for the field of quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of state-of-the-art classical computers, achieving so-called quantum supremacy. We study the task of sampling from the output distributions of (pseudo-)random quantum circuits, a natural task for benchmarking quantum computers. Crucially, sampling this distribution classically requires a direct numerical simulation of the circuit, with computational cost exponential in the number of qubits. This requirement is typical of chaotic systems. We extend previous results in computational complexity to argue more formally that this sampling task must take exponential time in a classical computer. We study the convergence to the chaotic regime using extensive supercomputer simulations, modeling circuits…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
