Quantum Supremacy Using a Programmable Superconducting Processor I

          @misc{ scivideos_15610,
            doi = {},
            url = {https://simons.berkeley.edu/talks/quantum-supremacy-using-programmable-superconducting-processor-i},
            author = {},
            keywords = {},
            language = {en},
            title = {Quantum Supremacy Using a Programmable Superconducting Processor I},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2020},
            month = {may},
            note = {15610 see, \url{https://scivideos.org/index.php/Simons-Institute/15610}}
          }
          

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 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^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 for this specific computational task, heralding a much-anticipated computing paradigm.