% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Arute:868375,
      author       = {Arute, Frank and Arya, Kunal and Babbush, Ryan and Bacon,
                      Dave and Bardin, Joseph C. and Barends, Rami and Biswas,
                      Rupak and Boixo, Sergio and Brandao, Fernando G. S. L. and
                      Buell, David A. and Burkett, Brian and Chen, Yu and Chen,
                      Zijun and Chiaro, Ben and Collins, Roberto and Courtney,
                      William and Dunsworth, Andrew and Farhi, Edward and Foxen,
                      Brooks and Fowler, Austin and Gidney, Craig and Giustina,
                      Marissa and Graff, Rob and Guerin, Keith and Habegger, Steve
                      and Harrigan, Matthew P. and Hartmann, Michael J. and Ho,
                      Alan and Hoffmann, Markus and Huang, Trent and Humble,
                      Travis S. and Isakov, Sergei V. and Jeffrey, Evan and Jiang,
                      Zhang and Kafri, Dvir and Kechedzhi, Kostyantyn and Kelly,
                      Julian and Klimov, Paul V. and Knysh, Sergey and Korotkov,
                      Alexander and Kostritsa, Fedor and Landhuis, David and
                      Lindmark, Mike and Lucero, Erik and Lyakh, Dmitry and
                      Mandrà, Salvatore and McClean, Jarrod R. and McEwen,
                      Matthew and Megrant, Anthony and Mi, Xiao and Michielsen,
                      Kristel and Mohseni, Masoud and Mutus, Josh and Naaman, Ofer
                      and Neeley, Matthew and Neill, Charles and Niu, Murphy
                      Yuezhen and Ostby, Eric and Petukhov, Andre and Platt, John
                      C. and Quintana, Chris and Rieffel, Eleanor G. and Roushan,
                      Pedram and Rubin, Nicholas C. and Sank, Daniel and
                      Satzinger, Kevin J. and Smelyanskiy, Vadim and Sung, Kevin
                      J. and Trevithick, Matthew D. and Vainsencher, Amit and
                      Villalonga, Benjamin and White, Theodore and Yao, Z. Jamie
                      and Yeh, Ping and Zalcman, Adam and Neven, Hartmut and
                      Martinis, John M.},
      title        = {{Q}uantum supremacy using a programmable superconducting
                      processor},
      journal      = {Nature},
      volume       = {574},
      number       = {7779},
      issn         = {1476-4687},
      address      = {London [u.a.]},
      publisher    = {Nature Publ. Group78092},
      reportid     = {FZJ-2019-06904},
      pages        = {505 - 510},
      year         = {2019},
      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.},
      cin          = {JSC},
      ddc          = {500},
      cid          = {I:(DE-Juel1)JSC-20090406},
      pnm          = {511 - Computational Science and Mathematical Methods
                      (POF3-511)},
      pid          = {G:(DE-HGF)POF3-511},
      typ          = {PUB:(DE-HGF)16},
      pubmed       = {pmid:31645734},
      UT           = {WOS:000492991700045},
      doi          = {10.1038/s41586-019-1666-5},
      url          = {https://juser.fz-juelich.de/record/868375},
}