Quantum computational supremacy

Aram W. Harrow and Ashley Montanaro ()
Additional contact information
Aram W. Harrow: Center for Theoretical Physics, Massachusetts Institute of Technology
Ashley Montanaro: School of Mathematics, University of Bristol

Nature, 2017, vol. 549, issue 7671, 203-209

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

Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://www.nature.com/articles/nature23458 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:549:y:2017:i:7671:d:10.1038_nature23458

Ordering information: This journal article can be ordered from
https://www.nature.com/

DOI: 10.1038/nature23458

Access Statistics for this article

Nature is currently edited by Magdalena Skipper

More articles in Nature from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().