Quantum Computational Supremacy
Quantum Physics
2018-09-21 v1
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.
Cite
@article{arxiv.1809.07442,
title = {Quantum Computational Supremacy},
author = {Aram W Harrow and Ashley Montanaro},
journal= {arXiv preprint arXiv:1809.07442},
year = {2018}
}
Comments
review article originally appearing in a Nature Insight collection on "Quantum Software". 15 pages