Journal Article

FZJ-2019-06904

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Quantum supremacy using a programmable superconducting processor

Arute, F. ; Arya, K. ; Babbush, R. ; Bacon, D. ; Bardin, J. C. ; Barends, R. ; Biswas, R. ; Boixo, S. ; Brandao, F. G. S. L. ; Buell, D. A. ; Burkett, B. ; Chen, Y. ; Chen, Z. ; Chiaro, B. ; Collins, R. ; Courtney, W. ; Dunsworth, A. ; Farhi, E. ; Foxen, B. ; Fowler, A. ; Gidney, C. ; Giustina, M. ; Graff, R. ; Guerin, K. ; Habegger, S. ; Harrigan, M. P. ; Hartmann, M. J. ; Ho, A. ; Hoffmann, M. ; Huang, T. ; Humble, T. S. ; Isakov, S. V. ; Jeffrey, E. ; Jiang, Z. ; Kafri, D. ; Kechedzhi, K. ; Kelly, J. ; Klimov, P. V. ; Knysh, S. ; Korotkov, A. ; Kostritsa, F. ; Landhuis, D. ; Lindmark, M. ; Lucero, E. ; Lyakh, D. ; Mandrà, S. ; McClean, J. R. ; McEwen, M. ; Megrant, A. ; Mi, X. ; Michielsen, K.FZJ* ; Mohseni, M. ; Mutus, J. ; Naaman, O. ; Neeley, M. ; Neill, C. ; Niu, M. Y. ; Ostby, E. ; Petukhov, A. ; Platt, J. C. ; Quintana, C. ; Rieffel, E. G. ; Roushan, P. ; Rubin, N. C. ; Sank, D. ; Satzinger, K. J. ; Smelyanskiy, V. ; Sung, K. J. ; Trevithick, M. D. ; Vainsencher, A. ; Villalonga, B. ; White, T. ; Yao, Z. J. ; Yeh, P. ; Zalcman, A. ; Neven, H. ; Martinis, J. M. (Corresponding author)

2019
Nature Publ. Group78092 London [u.a.]

This record in other databases:      

Please use a persistent id in citations: http://hdl.handle.net/2128/23802  doi:10.1038/s41586-019-1666-5

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 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.

---

Contributing Institute(s):

1. Jülich Supercomputing Center (JSC)

Research Program(s):

1. 511 - Computational Science and Mathematical Methods (POF3-511) (POF3-511)

Appears in the scientific report 2019

---

Database coverage:
; ; BIOSIS Previews ; Clarivate Analytics Master Journal List ; Current Contents - Agriculture, Biology and Environmental Sciences ; Current Contents - Life Sciences ; Current Contents - Physical, Chemical and Earth Sciences ; Ebsco Academic Search ; IF >= 40 ; JCR ; NCBI Molecular Biology Database ; Nationallizenz ; SCOPUS ; Science Citation Index ; Science Citation Index Expanded ; Web of Science Core Collection ; Zoological Record

---