Quantum computational supremacy

Sep 14, 2017
7 pages
Published in:
  • Nature 549 (2017) 203-209
  • Published: Sep 14, 2017

Citations per year

20172019202120232025020406080
Abstract: (Springer)
The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is beyond the capability of any classical computer, an event known as quantum supremacy. This would be easier to achieve experimentally than full-scale quantum computing, but involves new theoretical challenges. Here we present the leading proposals to achieve quantum supremacy, and discuss how we can reliably compare the power of a classical computer to the power of a quantum computer. Proposals for demonstrating quantum supremacy, when a quantum computer supersedes any possible classical computer at a specific task, are reviewed.
  • Computer science
  • Quantum information
  • computer: quantum
  • quantum information
  • quantum algorithm
  • quantum advantage