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

AI and Optical Data Sciences

Synchronously-pumped OPO coherent Ising machine: benchmarking and prospects

Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon, Davide Venturelli, Alireza Marandi, Dirk Robert Englund, Y. Yamamoto

Published Feb 24, 2020• 4 citations
Publisher

Abstract

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.

DOI
10.1117/12.2547046

Related papers

A coherent Ising machine with quantum measurement and feedback control

Yoshitaka Haribara, Y. Yamamoto, Ken‐ichi Kawarabayashi +1 more

Combinatorial optimization problems are computationally hard in general, but they are ubiquitous in our modern life. A coherent Ising machine (CIM) based on a multiple-pulse degenerate optical parametric oscillator (DOPO) is an alternative approach to solve these problems by a specialized physical computing system. To evaluate its potential performance, computational experiments are performed on maximum cut (MAX-CUT) problems against traditional algorithms such as semidefinite programming relaxation of Goemans-Williamson and simulated annealing by Kirkpatrick, et al. The numerical results empirically suggest that the almost constant computation time is required to obtain the reasonably accurate solutions of MAX-CUT problems on a CIM with the number of vertices up to $2 \times 10^4$ and the number of edges up to $10^8$.

•Jan 28, 2015•6 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

Performance Comparison between Coherent Ising Machines and Quantum Annealer

Hiroki Takesue, Takahiro Inagaki, Kensuke Inaba +1 more

NTT has been developing a coherent Ising machine (CIM), which efficiently finds solutions to groundstate-search problems of the Ising model using a network of optical parametric oscillators.We introduce our recent experiment that compared the computational performance of CIMs (the one developed by NTT and another developed by Stanford University) with a quantum annealer, which solves the Isingmodel problems using superconducting devices.

NTT technical review•May 1, 2021•3 citations

Coherent Ising machines—Quantum optics and neural network Perspectives

Y. Yamamoto, T. Leleu, Surya Ganguli +1 more

A coherent Ising machine (CIM) is a network of optical parametric oscillators (OPOs), in which the “strongest” collective mode of oscillation at well above threshold corresponds to an optimum solution of a given Ising problem. When a pump rate or network coupling rate is increased from below to above threshold, however, the eigenvectors with the smallest eigenvalue of the Ising coupling matrix [Jij] appear near threshold and impede the machine to relax to true ground states. Two complementary approaches to attack this problem are described here. One approach is to utilize the squeezed/anti-squeezed vacuum noise of OPOs below threshold to produce coherent spreading over numerous local minima via quantum noise correlation, which could enable the machine to access either true ground states or excited states with eigen-energies close enough to that of ground states above threshold. The other approach is to implement a real-time error correction feedback loop so that the machine migrates from one local minimum to another during an explorative search for ground states. Finally, a set of qualitative analogies connecting the CIM and traditional computer science techniques are pointed out. In particular, belief propagation and survey propagation used in combinatorial optimization are touched upon.

arXiv:2006.05649•Applied Physics Letters•Oct 19, 2020•96 citations

Speed-up coherent Ising machine with a squeezed feedback system

Lihaonan Luo, Hongjun Liu, Nan Huang +1 more

As a solver for non-deterministic polynomial time (NP)-hard combinatorial optimization problems, the coherent Ising machine (CIM) is in the early stages of research, and the potential of this innovative physical system will be developed. Here, we propose a speed-up coherent Ising machine with a squeezed feedback system, which we call S-CIM. We couple squeezed feedback pulses generated by the squeezed feedback system into the degenerate optical parametric oscillator (DOPO) network. Simulations indicate that quantum inseparability of the coupled DOPO network is further enhanced during the whole optimization process, and quantum fluctuations are significantly smaller around the oscillation threshold. Computation experiments are performed on MAX-CUT problems of order between 4 and 20000. Numerical results demonstrate that S-CIM increases the optimal normalized output by 2.27% and significantly reduces the optimal computation time by 75.12%.

Optics Express•Dec 26, 2019•8 citations

A poor man’s coherent Ising machine based on opto-electronic feedback systems for solving optimization problems

Fabian Böhm, Guy Verschaffelt, Guy Van der Sande

Coherent Ising machines (CIMs) constitute a promising approach to solve computationally hard optimization problems by mapping them to ground state searches of the Ising model and implementing them with optical artificial spin-networks. However, while CIMs promise speed-ups over conventional digital computers, they are still challenging to build and operate. Here, we propose and test a concept for a fully programmable CIM, which is based on opto-electronic oscillators subjected to self-feedback. Contrary to current CIM designs, the artificial spins are generated in a feedback induced bifurcation and encoded in the intensity of coherent states. This removes the necessity for nonlinear optical processes or large external cavities and offers significant advantages regarding stability, size and cost. We demonstrate a compact setup for solving MAXCUT optimization problems on regular and frustrated graphs with 100 spins and can report similar or better performance compared to CIMs based on degenerate optical parametric oscillators.

Nature Communications•Aug 8, 2019•231 citations
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.
Combinatorial optimization problems are computationally hard in general, but they are ubiquitous in our modern life. A coherent Ising machine (CIM) based on a multiple-pulse degenerate optical parametric oscillator (DOPO) is an alternative approach to solve these problems by a specialized physical computing system. To evaluate its potential performance, computational experiments are performed on maximum cut (MAX-CUT) problems against traditional algorithms such as semidefinite programming relaxation of Goemans-Williamson and simulated annealing by Kirkpatrick, et al. The numerical results empirically suggest that the almost constant computation time is required to obtain the reasonably accurate solutions of MAX-CUT problems on a CIM with the number of vertices up to 2×1042 \times 10^42×104 and the number of edges up to 10810^8108.
A coherent Ising machine (CIM) is a network of optical parametric oscillators (OPOs), in which the “strongest” collective mode of oscillation at well above threshold corresponds to an optimum solution of a given Ising problem. When a pump rate or network coupling rate is increased from below to above threshold, however, the eigenvectors with the smallest eigenvalue of the Ising coupling matrix [Jij] appear near threshold and impede the machine to relax to true ground states. Two complementary approaches to attack this problem are described here. One approach is to utilize the squeezed/anti-squeezed vacuum noise of OPOs below threshold to produce coherent spreading over numerous local minima via quantum noise correlation, which could enable the machine to access either true ground states or excited states with eigen-energies close enough to that of ground states above threshold. The other approach is to implement a real-time error correction feedback loop so that the machine migrates from one local minimum to another during an explorative search for ground states. Finally, a set of qualitative analogies connecting the CIM and traditional computer science techniques are pointed out. In particular, belief propagation and survey propagation used in combinatorial optimization are touched upon.
As a solver for non-deterministic polynomial time (NP)-hard combinatorial optimization problems, the coherent Ising machine (CIM) is in the early stages of research, and the potential of this innovative physical system will be developed. Here, we propose a speed-up coherent Ising machine with a squeezed feedback system, which we call S-CIM. We couple squeezed feedback pulses generated by the squeezed feedback system into the degenerate optical parametric oscillator (DOPO) network. Simulations indicate that quantum inseparability of the coupled DOPO network is further enhanced during the whole optimization process, and quantum fluctuations are significantly smaller around the oscillation threshold. Computation experiments are performed on MAX-CUT problems of order between 4 and 20000. Numerical results demonstrate that S-CIM increases the optimal normalized output by 2.27% and significantly reduces the optimal computation time by 75.12%.
Coherent Ising machines (CIMs) constitute a promising approach to solve computationally hard optimization problems by mapping them to ground state searches of the Ising model and implementing them with optical artificial spin-networks. However, while CIMs promise speed-ups over conventional digital computers, they are still challenging to build and operate. Here, we propose and test a concept for a fully programmable CIM, which is based on opto-electronic oscillators subjected to self-feedback. Contrary to current CIM designs, the artificial spins are generated in a feedback induced bifurcation and encoded in the intensity of coherent states. This removes the necessity for nonlinear optical processes or large external cavities and offers significant advantages regarding stability, size and cost. We demonstrate a compact setup for solving MAXCUT optimization problems on regular and frustrated graphs with 100 spins and can report similar or better performance compared to CIMs based on degenerate optical parametric oscillators.