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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Springer Nature America, Inc
2020
|
| Online Access: | https://hdl.handle.net/1721.1/123485 |
| _version_ | 1810995746974990336 |
|---|---|
| author | Harrow, Aram W. Montanaro, Ashley |
| author2 | Massachusetts Institute of Technology. Center for Theoretical Physics |
| author_facet | Massachusetts Institute of Technology. Center for Theoretical Physics Harrow, Aram W. Montanaro, Ashley |
| author_sort | Harrow, Aram W. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T14:02:10Z |
| format | Article |
| id | mit-1721.1/123485 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T14:02:10Z |
| publishDate | 2020 |
| publisher | Springer Nature America, Inc |
| record_format | dspace |
| spelling | mit-1721.1/1234852022-10-01T18:44:54Z Quantum Computational Supremacy Harrow, Aram W. Montanaro, Ashley Massachusetts Institute of Technology. Center for Theoretical Physics 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. National Science Foundation (U.S.) (Grant CCF-1629809) National Science Foundation (U.S.) (Grant CCF-1452616) 2020-01-21T16:50:34Z 2020-01-21T16:50:34Z 2017-09-14 2017-02-28 2019-03-26T15:33:21Z Article http://purl.org/eprint/type/JournalArticle 0028-0836 1476-4687 https://hdl.handle.net/1721.1/123485 Harrow, Aram W., and Ashley Montanaro. “Quantum Computational Supremacy.” Nature 549 (September 2017): 203–209 © 2017 Publisher http://dx.doi.org/10.1038/NATURE23458 Nature Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Springer Nature America, Inc arXiv |
| spellingShingle | Harrow, Aram W. Montanaro, Ashley Quantum Computational Supremacy |
| title | Quantum Computational Supremacy |
| title_full | Quantum Computational Supremacy |
| title_fullStr | Quantum Computational Supremacy |
| title_full_unstemmed | Quantum Computational Supremacy |
| title_short | Quantum Computational Supremacy |
| title_sort | quantum computational supremacy |
| url | https://hdl.handle.net/1721.1/123485 |
| work_keys_str_mv | AT harrowaramw quantumcomputationalsupremacy AT montanaroashley quantumcomputationalsupremacy |