Quantum supremacy using a programmable superconducting processor
Google (United States) · University of Massachusetts Amherst · +12 more institutions
Abstract
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. 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 qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). 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…
Citation impact
- FWCI
- 444.25
- Percentile
- 100%
- References
- 54
Authors
77- FAFrank AruteCorresponding
Google (United States)
- KAKunal Arya
Google (United States)
- RBRyan Babbush
Google (United States)
- DBDave Bacon
Google (United States)
- JCJoseph C. Bardin
University of Massachusetts Amherst, Google (United States)
Topics & keywords
- Quantum computer
- Quantum
- Realization (probability)
- Dimension (graph theory)
- Quantum algorithm
- Task (project management)
- Quantum circuit
- Sample (material)
Funding
- UDU.S. Department of EnergyAwards: AC05-00OR22725, DE-AC05, 00OR22725
- NANational Aeronautics and Space AdministrationAward: DE-AC05-00OR22725
- OOOffice of ScienceAwards: DE-AC05-00OR22725, AC05-00OR22725
- ARAmes Research Center
- UOUniversity of California, Santa Barbara
- AFAir Force Research LaboratoryAwards: F4HBKC4162G001, DE-AC05-00OR22725