Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1805.05217 · Science Advances

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

Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon, Davide Venturelli, Alireza Marandi, Tatsuhiro Onodera, Edwin Ng, Carsten Langrock, Kensuke Inaba, Toshimori Honjo, Koji Enbutsu, Takeshi Umeki, Ryoichi Kasahara, Shoko Utsunomiya, Satoshi Kako, Ken-ichi Kawarabayashi, Robert L. Byer, M. M. Fejer, Hideo Mabuchi, Dirk Robert Englund, Eleanor Gilbert Rieffel, Hiroki Takesue, Y. Yamamoto

Published May 3, 2019• 396 citations
arXivHTMLPDF

Abstract

Benchmarking the coherent Ising machine and the D-Wave quantum annealer sheds light on the importance of connectivity.
DOI
10.1126/sciadv.aau0823

Related papers

Benchmarking coherent Ising machines and quantum annealers with MAX-CUT and SK problems

Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon +10 more

Bulletin of the American Physical Society•Mar 6, 2019•0 citations

Comment on "Scaling advantages of all-to-all connectivity in physical annealers: the Coherent Ising Machine vs D-Wave 2000Q" [arXiv:1805.05217]

Catherine C. McGeoch, William Bernoudy, James King

A recent paper [arXiv:1805.05217] compares performance of a D-Wave 2000Q system to two versions of the coherent Ising machine (CIM). This comment points out some flaws in the analysis, which undermine several of the conclusions drawn in the paper.

arXiv:1807.00089•Jun 29, 2018•8 citations

Benchmarking the D-Wave Quantum Annealer as a Sparse Boltzmann Machine: Recognition and Timing Performances

Jessica Park, Nicholas Chancellor, David Griffin +2 more

Lecture notes in computer science•Jan 1, 2024•0 citations

Quantum vs. Optical Annealing: Benchmarking the OPO Ising Machine and D-Wave

Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon +9 more

We benchmark the OPO-based Coherent Ising Machine (CIM) against the D-Wave quantum annealer for Ising problems up to size N = 200. The CIM exhibits exponential speedup relative to D-Wave for Ising problems with dense connectivity.

Conference on Lasers and Electro-Optics•Jan 1, 2018•8 citations

Synchronously-pumped OPO coherent Ising machine: benchmarking and prospects

Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon +4 more

The coherent Ising machine (CIM) is a network of optical parametric oscillators (OPOs) that solves for the ground state of Ising problems through OPO bifurcation dynamics. Here, we present experimental results comparing the performance of the CIM to quantum annealers (QAs) on two classes of NP-hard optimization problems: ground state calculation of the Sherrington-Kirkpatrick (SK) model and MAX-CUT. While the two machines perform comparably on sparsely-connected problems such as cubic MAX-CUT, on problems with dense connectivity, the QA shows an exponential performance penalty relative to CIMs. We attribute this to the embedding overhead required to map dense problems onto the sparse hardware architecture of the QA, a problem that can be overcome in photonic architectures such as the CIM.

AI and Optical Data Sciences•Feb 24, 2020•4 citations

Performance of quantum annealing on random Ising problems implemented using the D-Wave Two

Zhihui Wang, Joshua Job, Troels F. R Onnow +2 more

Bulletin of the American Physical Society•Mar 4, 2014•1 citation
The coherent Ising machine (CIM) is a network of optical parametric oscillators (OPOs) that solves for the ground state of Ising problems through OPO bifurcation dynamics. Here, we present experimental results comparing the performance of the CIM to quantum annealers (QAs) on two classes of NP-hard optimization problems: ground state calculation of the Sherrington-Kirkpatrick (SK) model and MAX-CUT. While the two machines perform comparably on sparsely-connected problems such as cubic MAX-CUT, on problems with dense connectivity, the QA shows an exponential performance penalty relative to CIMs. We attribute this to the embedding overhead required to map dense problems onto the sparse hardware architecture of the QA, a problem that can be overcome in photonic architectures such as the CIM.