Quantum computational supremacy

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 kn...

Full description

Saved in:
Bibliographic Details
Published in:Nature (London) Vol. 549; no. 7671; pp. 203 - 209
Main Authors: Harrow, Aram W., Montanaro, Ashley
Format: Journal Article
Language:English
Published: London Nature Publishing Group UK 14.09.2017
Nature Publishing Group
Subjects:
639/705/117
639/766/483/481
Algorithms
Complexity theory
Computation
Computer applications
Computer based research
Computers
Experiments
Humanities and Social Sciences
Methods
multidisciplinary
Noise
Quantum computing
Quantum mechanics
Quantum physics
Quantum theory
review-article
Science
Simulation
ISSN:0028-0836, 1476-4687, 1476-4687
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. Proposals for demonstrating quantum supremacy, when a quantum computer supersedes any possible classical computer at a specific task, are reviewed.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0028-0836
1476-4687
1476-4687
DOI:10.1038/nature23458