Quantum computational supremacy

Aram Harrow, Ashley Montanaro

Research output: Contribution to journalArticle (Academic Journal)peer-review

189 Citations (Scopus)
2857 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)203-209
Number of pages7
Early online date13 Sep 2017
Publication statusPublished - 14 Sep 2017

Structured keywords

  • QITG
  • Bristol Quantum Information Institute

Cite this