Experimental investigation of performance differences between coherent Ising machines and a quantum annealer

被引:224
作者
Hamerly, Ryan [1 ,2 ]
Inagaki, Takahiro [3 ]
McMahon, Peter L. [2 ,4 ,5 ]
Venturelli, Davide [6 ,7 ]
Marandi, Alireza [4 ,8 ]
Onodera, Tatsuhiro [4 ]
Ng, Edwin [4 ]
Langrock, Carsten [4 ]
Inaba, Kensuke [3 ]
Honjo, Toshimori [3 ]
Enbutsu, Koji [9 ]
Umeki, Takeshi [9 ]
Kasahara, Ryoichi [9 ]
Utsunomiya, Shoko [2 ]
Kako, Satoshi [2 ]
Kawarabayashi, Ken-ichi [2 ]
Byer, Robert L. [4 ]
Fejer, Martin M. [4 ]
Mabuchi, Hideo [4 ]
Englund, Dirk [1 ]
Rieffel, Eleanor [6 ]
Takesue, Hiroki [3 ]
Yamamoto, Yoshihisa [4 ,10 ]
机构
[1] MIT, Res Lab Elect, 50 Vassar St, Cambridge, MA 02139 USA
[2] Natl Inst Informat, Chiyoda Ku, Hitotsubashi 2-1-2, Tokyo 1018403, Japan
[3] NTT Corp, NTT Basic Res Labs, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 2430198, Japan
[4] Stanford Univ, EL Ginzton Lab, Stanford, CA 94305 USA
[5] Cornell Univ, Sch Appl & Engn Phys, Ithaca, NY 14853 USA
[6] NASA, Ames Res Ctr, Quantum Artificial Intelligence Lab QuAIL, Mail Stop 269-1, Moffett Field, CA 94035 USA
[7] USRA, RIACS, 615 Natl Ave, Moffett Field, CA 94035 USA
[8] CALTECH, Pasadena, CA 91125 USA
[9] NTT Corp, NTT Device Technol Labs, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 2430198, Japan
[10] Japan Sci & Technol Agcy, ImPACT Program, Chiyoda Ku, Gobancho 7, Tokyo 1020076, Japan
关键词
OPTICAL PARAMETRIC OSCILLATORS; SQUEEZED STATES; MAX-CUT; OPTIMIZATION; GENERATION; MECHANICS; CIRCUITS; NETWORK;
D O I
10.1126/sciadv.aau0823
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Physical annealing systems provide heuristic approaches to solving combinatorial optimization problems. Here, we benchmark two types of annealing machines-a quantum annealer built by D-Wave Systems and measurement-feedback coherent Ising machines (CIMs) based on optical parametric oscillators-on two problem classes, the Sherrington-Kirkpatrick (SK) model and MAX-CUT. The D-Wave quantum annealer outperforms the CIMs on MAX-CUT on cubic graphs. On denser problems, however, we observe an exponential penalty for the quantum annealer [exp(-alpha N-DW(2))] relative to CIMs [exp(-alpha N-CIM)] for fixed anneal times, both on the SK model and on 50% edge density MAX-CUT. This leads to a several orders of magnitude time-to-solution difference for instances with over 50 vertices. An optimal-annealing time analysis is also consistent with a substantial projected performance difference. The difference in performance between the sparsely connected D-Wave machine and the fully-connected CIMs provides strong experimental support for efforts to increase the connectivity of quantum annealers.
引用
收藏
页数:10
相关论文
共 64 条
[1]   Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing [J].
Albash, Tameem ;
Lidar, Daniel A. .
PHYSICAL REVIEW X, 2018, 8 (03)
[2]  
Alimonti P, 1997, LECT NOTES COMPUT SC, V1203, P288
[3]  
[Anonymous], ARXIV180608422QUANTP
[4]   ON THE COMPUTATIONAL-COMPLEXITY OF ISING SPIN-GLASS MODELS [J].
BARAHONA, F .
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1982, 15 (10) :3241-3253
[5]   Breakout Local Search for the Max-Cut problem [J].
Benlic, Una ;
Hao, Jin-Kao .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2013, 26 (03) :1162-1173
[6]  
Boixo S, 2014, NAT PHYS, V10, P218, DOI [10.1038/NPHYS2900, 10.1038/nphys2900]
[7]   Fast clique minor generation in Chimera qubit connectivity graphs [J].
Boothby, Tomas ;
King, Andrew D. ;
Roy, Aidan .
QUANTUM INFORMATION PROCESSING, 2016, 15 (01) :495-508
[8]  
Boyd R. W., 2003, NONLINEAR OPTICS
[9]  
Cai J., 2014, ARXIV14062741QUANTPH
[10]  
Chen Y., 2017, B AM PHYS SOC