**Abstract:** The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor

. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits^{1}^{2}^{,}^{3}^{,}^{4}^{,}^{5}^{,}^{6}^{,}

to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^{7}^{53} (about 10^{16}). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy^{8}^{,}^{9}^{,}^{10}^{,}^{11}^{,}^{12}^{,}^{13}^{,}

for this specific computational task, heralding a much-anticipated computing paradigm.^{14}

Scott Aaronson:

Scott’s Supreme Quantum Supremacy FAQ!

Quantum supremacy: the gloves are off