Journal
NATURE
Volume 549, Issue 7671, Pages 203-209Publisher
NATURE PUBLISHING GROUP
DOI: 10.1038/nature23458
Keywords
-
Categories
Funding
- NSF [CCF-1629809, CCF-1452616]
- EPSRC Early Career Fellowship [EP/L021005/1]
- EPSRC [EP/L021005/1] Funding Source: UKRI
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1629809] Funding Source: National Science Foundation
- Engineering and Physical Sciences Research Council [EP/L021005/1] Funding Source: researchfish
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available