Skip to main content

Quantum supremacy using a programmable superconducting processor

Cite this dataset

Martinis, John M. et al. (2022). Quantum supremacy using a programmable superconducting processor [Dataset]. Dryad.


The tantalizing 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 using a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 ∼ 10^16. Measurements from repeated experiments sample the corresponding probability distribution, which we verify using classical simulations. While our processor takes about 200 seconds to sample one instance of a quantum circuit 1 million times, a state-of-the-art supercomputer would require approximately 10,000 years to perform the equivalent task. This dramatic speedup relative to all known classical algorithms provides an experimental realization of quantum supremacy on a computational task and heralds the advent of a much-anticipated computing paradigm.


This dataset defines the Random Quantum Circuits (RQCs) used in our quantum supremacy demonstration and lists the bitstrings observed in the experimental executions of the circuits on the Sycamore processor.

Usage notes

Please see Readme file.