A fully programmable 100-spin coherent Ising machine with all-to-all connections

Peter L McMahon; Alireza Marandi; Yoshitaka Haribara; Ryan Hamerly; Carsten Langrock; Shuhei Tamate; Takahiro Inagaki; Hiroki Takesue; Shoko Utsunomiya; Kazuyuki Aihara; Robert L Byer; M M Fejer; Hideo Mabuchi; Yoshihisa Yamamoto

doi:10.1126/science.aah5178

A fully programmable 100-spin coherent Ising machine with all-to-all connections

Science. 2016 Nov 4;354(6312):614-617. doi: 10.1126/science.aah5178. Epub 2016 Oct 20.

Authors

Peter L McMahon^{1

2}, Alireza Marandi¹, Yoshitaka Haribara^{2

3

4}, Ryan Hamerly⁵, Carsten Langrock⁵, Shuhei Tamate², Takahiro Inagaki⁶, Hiroki Takesue⁶, Shoko Utsunomiya², Kazuyuki Aihara^{3

4}, Robert L Byer⁵, M M Fejer⁵, Hideo Mabuchi⁵, Yoshihisa Yamamoto^{5

7}

Affiliations

¹ E. L. Ginzton Laboratory, Stanford University, Stanford, CA 94305, USA. pmcmahon@stanford.edu marandi@stanford.edu.
² National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan.
³ Department of Mathematical Informatics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan.
⁴ Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505, Japan.
⁵ E. L. Ginzton Laboratory, Stanford University, Stanford, CA 94305, USA.
⁶ NTT Basic Research Laboratories, 3-1 Morinosato, Wakamiya, Atsugi, Kanagawa 243-0198, Japan.
⁷ ImPACT Program, Japan Science and Technology Agency, Gobancho 7, Chiyoda-ku, Tokyo 102-0076, Japan.

PMID: 27811274
DOI: 10.1126/science.aah5178

Abstract

Unconventional, special-purpose machines may aid in accelerating the solution of some of the hardest problems in computing, such as large-scale combinatorial optimizations, by exploiting different operating mechanisms than those of standard digital computers. We present a scalable optical processor with electronic feedback that can be realized at large scale with room-temperature technology. Our prototype machine is able to find exact solutions of, or sample good approximate solutions to, a variety of hard instances of Ising problems with up to 100 spins and 10,000 spin-spin connections.

Publication types

Research Support, Non-U.S. Gov't