A blueprint for demonstrating quantum supremacy with superconducting qubits

被引：337

作者：

Neill, C. ^{[1
]}

Roushan, P. ^{[2
]}

Kechedzhi, K. ^{[3
,4
]}

Boixo, S. ^{[2
]}

Isakov, S. V. ^{[2
]}

Smelyanskiy, V. ^{[2
]}

Megrant, A. ^{[2
]}

Chiaro, B. ^{[1
]}

Dunsworth, A. ^{[1
]}

Arya, K. ^{[2
]}

Barends, R. ^{[2
]}

Burkett, B. ^{[2
]}

Chen, Y. ^{[2
]}

Chen, Z. ^{[1
]}

Fowler, A. ^{[2
]}

Foxen, B. ^{[1
]}

Giustina, M. ^{[2
]}

Graff, R. ^{[2
]}

Jeffrey, E. ^{[2
]}

Huang, T. ^{[2
]}

Kelly, J. ^{[2
]}

Klimov, P. ^{[2
]}

Lucero, E. ^{[2
]}

Mutus, J. ^{[2
]}

Neeley, M. ^{[2
]}

Quintana, C. ^{[1
]}

Sank, D. ^{[2
]}

Vainsencher, A. ^{[2
]}

Wenner, J. ^{[1
]}

White, T. C. ^{[2
]}

Neven, H. ^{[2
]}

Martinis, J. M. ^{[1
,2
]}

机构：

[1] Univ Calif Santa Barbara, Dept Phys, Santa Barbara, CA 93106 USA

[2] Google, Santa Barbara, CA 93117 USA

[3] NASA, Ames Res Ctr, Quantum Artificial Intelligence Lab QuAIL, Moffett Field, CA 94035 USA

[4] Univ Space Res Assoc, Mountain View, CA 94043 USA

来源：

SCIENCE | 2018年 / 360卷 / 6385期

关键词：

SYSTEMS;

D O I：

10.1126/science.aao4309

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

A key step toward demonstrating a quantum system that can address difficult problems in physics and chemistry will be performing a computation beyond the capabilities of any classical computer, thus achieving so-called quantum supremacy. In this study, we used nine superconducting qubits to demonstrate a promising path toward quantum supremacy. By individually tuning the qubit parameters, we were able to generate thousands of distinct Hamiltonian evolutions and probe the output probabilities. The measured probabilities obey a universal distribution, consistent with uniformly sampling the full Hilbert space. As the number of qubits increases, the system continues to explore the exponentially growing number of states. Extending these results to a system of 50 qubits has the potential to address scientific questions that are beyond the capabilities of any classical computer.

引用

页码：195 / 198

页数：4

共 23 条

[1]

[Anonymous], P INT C HIGH PERF CO

[2]

[Anonymous], 2011, P 43 ANN ACM S THEOR, DOI 10.1145/1993636.1993682

[3]

[Anonymous], 2012, ARXIV12035813QUANTPH

[4] Metal-insulator transition in a weakly interacting many-electron system with localized single-particle states [J].

Basko, DM ;

Aleiner, IL ;

Altshuler, BL .

ANNALS OF PHYSICS, 2006, 321 (05) :1126-1205

[5]

Boixo S., 2016, ARXIV160800263QUANTP

[6]

Boixo S, 2014, NAT PHYS, V10, P218, DOI [10.1038/nphys2900, 10.1038/NPHYS2900]

[7] Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations [J].

Bremner, Michael J. ;

Montanaro, Ashley ;

Shepherd, Dan J. .

PHYSICAL REVIEW LETTERS, 2016, 117 (08)

[8] Quantum Simulators [J].

Buluta, Iulia ;

Nori, Franco .

SCIENCE, 2009, 326 (5949) :108-111

[9] What is the Computational Value of Finite-Range Tunneling? [J].

Denchev, Vasil S. ;

Boixo, Sergio ;

Isakov, Sergei V. ;

Ding, Nan ;

Babbush, Ryan ;

Smelyanskiy, Vadim ;

Martinis, John ;

Neven, Hartmut .

PHYSICAL REVIEW X, 2016, 6 (03)

[10] SIMULATING PHYSICS WITH COMPUTERS [J].

FEYNMAN, RP .

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1982, 21 (6-7) :467-488

← 1 2 3 →