Quantum Computational Supremacy
Name
1809.07442.pdf
Size
380.03 KB
Format
Adobe PDF
Checksum (MD5)
c01633624510ba29dd9ba2b0aa7c698f
Author(s)
Harrow, Aram W.
Montanaro, Ashley
Date Issued
September 14, 2017
Journal
Nature
Publisher
Springer Nature America, Inc
Citation
Harrow, Aram W., and Ashley Montanaro. “Quantum Computational Supremacy.” Nature 549 (September 2017): 203–209 © 2017 Publisher
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1038/NATURE23458
