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

NTT technical review

Performance Comparison between Coherent Ising Machines and Quantum Annealer

Hiroki Takesue, Takahiro Inagaki, Kensuke Inaba, Toshimori Honjo

Published May 1, 2021• 3 citations
Publisher

Abstract

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.

DOI
10.53829/ntr202105fa2

Related papers

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

The Future of Problem Solving: The Coherent Ising Machine Approach

Y. Yamamoto

Several new computing models tackle combinatorial optimization problems.These include adiabatic quantum computation, also known as quantum annealing, and the coherent Ising machine (CIM).The Physics and Informatics Laboratories at NTT Research launched a CIM initiative, and NTT Basic Research Laboratories built large-scale CIM prototypes.This article reviews the CIM approach, results to date, and future research agenda.

NTT technical review•Jan 1, 2022•0 citations

A coherent Ising machine based on a network of 100,000 degenerate optical parametric oscillator pulses

Toshimori Honjo, Kensuke Inaba, Takahiro Inagaki +3 more

Coherent Ising machines (CIMs) are increasingly anticipated as a new computer that can solve combinatorial optimization problems. CIMs use degenerate optical parametric oscillator pulses as artificial spins. We constructed a 100,512-spin coherent Ising machine, the world's largest. Our CIM can find good solutions to maximum cut problems of 100,000-node graphs ~1000 times faster than simulated annealing. Furthermore, it provides both very good scores and a broad distribution when we operate it near the phase transition point.

IEEE International Conference on Nanotechnology (IEEE-NANO)•Jul 4, 2022•6 citations

Large-scale Coherent Ising Machine

Hiroki Takesue, Takahiro Inagaki, Kensuke Inaba +2 more

Today, world-wide efforts are being undertaken to explore non-von Neumann computation methods to overcome "the end of Moore's law". A promising approach is the coherent Ising machine (CIM), which utilizes a network of degenerate optical parametric oscillators for solving ground-state-search problems of the Ising model. Since its proposal in 2013 and the first proof-of-principle experiment in 2014, research on experimental CIMs has made rapid progress and now reached the level where we can find solutions to large-scale combinatorial optimization problems using a CIM system. In this paper, we review recent progress on CIMs, mainly focusing on the experimental side.

Journal of the Physical Society of Japan•Mar 1, 2019•32 citations

100,000-spin coherent Ising machine

Toshimori Honjo, Tomohiro Sonobe, Kensuke Inaba +9 more

Computers based on physical systems are increasingly anticipated to overcome the impending limitations on digital computer performance. One such computer is a coherent Ising machine (CIM) for solving combinatorial optimization problems. Here, we report a CIM with 100,512 degenerate optical parametric oscillator pulses working as the Ising spins. We show that the CIM delivers fine solutions to maximum cut problems of 100,000-node graphs drastically faster than standard simulated annealing. Moreover, the CIM, when operated near the phase transition point, provides some extremely good solutions and a very broad distribution. This characteristic will be useful for applications that require fast random sampling such as machine learning.

Science Advances•Sep 29, 2021•370 citations

Annealing by simulating the coherent Ising machine

Egor S. Tiunov, Alexander E. Ulanov, Alexander I. Lvovsky

The coherent Ising machine (CIM) enables efficient sampling of low-lying energy states of the Ising Hamiltonian with all-to-all connectivity by encoding the spins in the amplitudes of pulsed modes in an optical parametric oscillator (OPO). The interaction between the pulses is realized by means of measurement-based optoelectronic feedforward, which enhances the gain for lower-energy spin configurations. We present an efficient method of simulating the CIM on a classical computer that outperforms the CIM itself, as well as the noisy mean-field annealer in terms of both the quality of the samples and the computational speed. It is furthermore advantageous with respect to the CIM in that it can handle Ising Hamiltonians with arbitrary real-valued node coupling strengths. These results illuminate the nature of the faster performance exhibited by the CIM and may give rise to a new class of quantum-inspired algorithms of classical annealing that can successfully compete with existing methods.

arXiv:1901.08927•Optics Express•Mar 28, 2019•95 citations
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.
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.
Coherent Ising machines (CIMs) are increasingly anticipated as a new computer that can solve combinatorial optimization problems. CIMs use degenerate optical parametric oscillator pulses as artificial spins. We constructed a 100,512-spin coherent Ising machine, the world's largest. Our CIM can find good solutions to maximum cut problems of 100,000-node graphs ~1000 times faster than simulated annealing. Furthermore, it provides both very good scores and a broad distribution when we operate it near the phase transition point.
Today, world-wide efforts are being undertaken to explore non-von Neumann computation methods to overcome "the end of Moore's law". A promising approach is the coherent Ising machine (CIM), which utilizes a network of degenerate optical parametric oscillators for solving ground-state-search problems of the Ising model. Since its proposal in 2013 and the first proof-of-principle experiment in 2014, research on experimental CIMs has made rapid progress and now reached the level where we can find solutions to large-scale combinatorial optimization problems using a CIM system. In this paper, we review recent progress on CIMs, mainly focusing on the experimental side.
Computers based on physical systems are increasingly anticipated to overcome the impending limitations on digital computer performance. One such computer is a coherent Ising machine (CIM) for solving combinatorial optimization problems. Here, we report a CIM with 100,512 degenerate optical parametric oscillator pulses working as the Ising spins. We show that the CIM delivers fine solutions to maximum cut problems of 100,000-node graphs drastically faster than standard simulated annealing. Moreover, the CIM, when operated near the phase transition point, provides some extremely good solutions and a very broad distribution. This characteristic will be useful for applications that require fast random sampling such as machine learning.
The coherent Ising machine (CIM) enables efficient sampling of low-lying energy states of the Ising Hamiltonian with all-to-all connectivity by encoding the spins in the amplitudes of pulsed modes in an optical parametric oscillator (OPO). The interaction between the pulses is realized by means of measurement-based optoelectronic feedforward, which enhances the gain for lower-energy spin configurations. We present an efficient method of simulating the CIM on a classical computer that outperforms the CIM itself, as well as the noisy mean-field annealer in terms of both the quality of the samples and the computational speed. It is furthermore advantageous with respect to the CIM in that it can handle Ising Hamiltonians with arbitrary real-valued node coupling strengths. These results illuminate the nature of the faster performance exhibited by the CIM and may give rise to a new class of quantum-inspired algorithms of classical annealing that can successfully compete with existing methods.