Quantum computational supremacy

被引:542
作者
Harrow, Aram W. [1 ]
Montanaro, Ashley [2 ]
机构
[1] MIT, Ctr Theoret Phys, Cambridge, MA 02139 USA
[2] Univ Bristol, Sch Math, Bristol BS8 1TW, Avon, England
基金
英国工程与自然科学研究理事会; 美国国家科学基金会;
关键词
COMPLEXITY;
D O I
10.1038/nature23458
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
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.
引用
收藏
页码:203 / 209
页数:7
相关论文
共 56 条
[1]   Improved simulation of stabilizer circuits [J].
Aaronson, S ;
Gottesman, D .
PHYSICAL REVIEW A, 2004, 70 (05) :052328-1
[2]   Quantum computing, postselection, and probabilistic polynomial-time [J].
Aaronson, S .
PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2005, 461 (2063) :3473-3482
[3]  
Aaronson S, 2014, QUANTUM INF COMPUT, V14, P1383
[4]  
Aharonov D, 2013, COMPUTABILITY: TURING, GODEL, CHURCH, AND BEYOND, P329
[5]  
[Anonymous], 2016, QUANTUM SUPREMACY QU
[6]  
[Anonymous], DIRECT CERTIFICATION
[7]  
[Anonymous], 2014, GAUSSIAN NOISE SENSI
[8]  
[Anonymous], 1991, IJCAI, DOI [DOI 10.5555/1631171.1631221, 10.5555/1631171.1631221]
[9]  
[Anonymous], 2013, THEORY COMPUT, DOI DOI 10.4086/toc.2013.v009a004
[10]  
[Anonymous], 2016, COMPLEXITY THEORETIC