Quantum computational supremacy

Aram Harrow; Ashley Montanaro

doi:10.1038/nature23458

Quantum computational supremacy

Aram Harrow, Ashley Montanaro

Research output: Contribution to journal › Article (Academic Journal) › peer-review

509 Citations (Scopus)

3460 Downloads (Pure)

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.

Original language	English
Pages (from-to)	203-209
Number of pages	7
Journal	Nature
Volume	549
Early online date	13 Sept 2017
DOIs	https://doi.org/10.1038/nature23458
Publication status	Published - 14 Sept 2017

Research Groups and Themes

QITG
Bristol Quantum Information Institute

Access to Document

10.1038/nature23458

Full-text PDF (accepted author manuscript)
This is the author accepted manuscript (AAM). The final published version (version of record) is available online via Nature Publishing Group at http://www.nature.com/articles/nature23458 . Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 286 KB

Handle.net

Persistent link

New insights in quantum algorithms and complexity
Montanaro, A. M. R. (Principal Investigator)
31/07/14 → 30/06/20
Project: Research
New insights in quantum algorithms and complexity
Montanaro, A. M. R. (Principal Investigator)
31/07/14 → 30/07/19
Project: Research

Professor Ashley M R Montanaro
- Ashley.Montanarobristol.acuk
- School of Mathematics - Professor of Quantum Computation
- Algorithms and Complexity
- Mathematical Physics
- Quantum Information Theory
Person: Academic , Member, Group lead

Cite this

@article{aed6b1bb766c4fb48e1f5abca57db559,

title = "Quantum computational supremacy",

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.",

author = "Aram Harrow and Ashley Montanaro",

year = "2017",

month = sep,

day = "14",

doi = "10.1038/nature23458",

language = "English",

volume = "549",

pages = "203--209",

journal = "Nature",

issn = "0028-0836",

publisher = "Springer Nature",

}

TY - JOUR

T1 - Quantum computational supremacy

AU - Harrow, Aram

AU - Montanaro, Ashley

PY - 2017/9/14

Y1 - 2017/9/14

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

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

U2 - 10.1038/nature23458

DO - 10.1038/nature23458

M3 - Article (Academic Journal)

C2 - 28905912

SN - 0028-0836

VL - 549

SP - 203

EP - 209

JO - Nature

JF - Nature

ER -

Quantum computational supremacy

Abstract

Research Groups and Themes

Access to Document

Handle.net

Fingerprint

Projects

New insights in quantum algorithms and complexity

New insights in quantum algorithms and complexity

Profiles

Professor Ashley M R Montanaro

Cite this