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

SPIE Newsroom

Solving complex optimization problems with a coherent Ising machine

Hiroki Takesue, Takahiro Inagaki, Toshimori Honjo

Published Jul 19, 2017• 0 citations
Publisher
DOI
10.1117/2.1201702.006859

Related papers

Combinatorial optimization with coherent Ising machine

Takahiro Inagaki

The Japan Society of Applied Physics•Jul 10, 2018•0 citations

Solving intractable problems with coherent Ising machine

Hiroki Takesue, Takahiro Inagaki, Kensuke Inaba +6 more

We introduce the recent progress of coherent Ising machine (CIM), which finds solutions to complex combinatorial optimization problems using a network of degenerate optical parametric oscillators (DOPO). We describe our effort to generate time-multiplexed DOPOs using long-distance fiber cavities including telecom-band phase sensitive amplifiers [1-4]. We then present our experiments where we found solutions to complex combinatorial optimization problems using a CIM with measurement-feedback scheme [5]. Finally, a future perspective of the CIM project will briefly described.

JSAP-OSA Joint Symposia•Jan 1, 2017•0 citations

Optimization by Neural Networks in the Coherent Ising Machine and its Application to Wireless Communication Systems

Mikio Hasegawa, Hirotake Ito, Hiroki Takesue +1 more

Recently, new optimization machines based on non-silicon physical systems, such as quantum annealing machines, have been developed, and their commercialization has been started. These machines solve the problems by searching the state of the Ising spins, which minimizes the Ising Hamiltonian. Such a property of minimization of the Ising Hamiltonian can be applied to various combinatorial optimization problems. In this paper, we introduce the coherent Ising machine (CIM), which can solve the problems in a milli-second order, and has higher performance than the quantum annealing machines especially on the problems with dense mutual connections in the corresponding Ising model. We explain how a target problem can be implemented on the CIM, based on the optimization scheme using the mutually connected neural networks. We apply the CIM to traveling salesman problems as an example benchmark, and show experimental results of the real machine of the CIM. We also apply the CIM to several combinatorial optimization problems in wireless communication systems, such as channel assignment problems. The CIM's ultra-fast optimization may enable a real-time optimization of various communication systems even in a dynamic communication environment.

IEICE Transactions on Communications•Aug 31, 2020•31 citations

Ising machines as hardware solvers of combinatorial optimization problems

Naeimeh Mohseni, Peter L. McMahon, Tim Byrnes

arXiv:2204.00276•Nature Reviews Physics•May 4, 2022•635 citations

Ground state search of Ising model with coherent Ising machine

Takahiro Inagaki, Ryan Hamerly, Toshimori Honjo +6 more

The Japan Society of Applied Physics•Jul 21, 2017•0 citations

A single shot coherent Ising machine based on a network of injection-locked multicore fiber lasers

Masoud Babaeian, Dan Trung Nguyen, Veysi Demir +6 more

Combinatorial optimization problems over large and complex systems have many applications in social networks, image processing, artificial intelligence, computational biology and a variety of other areas. Finding the optimized solution for such problems in general are usually in non-deterministic polynomial time (NP)-hard complexity class. Some NP-hard problems can be easily mapped to minimizing an Ising energy function. Here, we present an analog all-optical implementation of a coherent Ising machine (CIM) based on a network of injection-locked multicore fiber (MCF) lasers. The Zeeman terms and the mutual couplings appearing in the Ising Hamiltonians are implemented using spatial light modulators (SLMs). As a proof-of-principle, we demonstrate the use of optics to solve several Ising Hamiltonians for up to thirteen nodes. Overall, the average accuracy of the CIM to find the ground state energy was ~90% for 120 trials. The fundamental bottlenecks for the scalability and programmability of the presented CIM are discussed as well.

Nature Communications•Aug 6, 2019•100 citations
We introduce the recent progress of coherent Ising machine (CIM), which finds solutions to complex combinatorial optimization problems using a network of degenerate optical parametric oscillators (DOPO). We describe our effort to generate time-multiplexed DOPOs using long-distance fiber cavities including telecom-band phase sensitive amplifiers [1-4]. We then present our experiments where we found solutions to complex combinatorial optimization problems using a CIM with measurement-feedback scheme [5]. Finally, a future perspective of the CIM project will briefly described.
Recently, new optimization machines based on non-silicon physical systems, such as quantum annealing machines, have been developed, and their commercialization has been started. These machines solve the problems by searching the state of the Ising spins, which minimizes the Ising Hamiltonian. Such a property of minimization of the Ising Hamiltonian can be applied to various combinatorial optimization problems. In this paper, we introduce the coherent Ising machine (CIM), which can solve the problems in a milli-second order, and has higher performance than the quantum annealing machines especially on the problems with dense mutual connections in the corresponding Ising model. We explain how a target problem can be implemented on the CIM, based on the optimization scheme using the mutually connected neural networks. We apply the CIM to traveling salesman problems as an example benchmark, and show experimental results of the real machine of the CIM. We also apply the CIM to several combinatorial optimization problems in wireless communication systems, such as channel assignment problems. The CIM's ultra-fast optimization may enable a real-time optimization of various communication systems even in a dynamic communication environment.
Combinatorial optimization problems over large and complex systems have many applications in social networks, image processing, artificial intelligence, computational biology and a variety of other areas. Finding the optimized solution for such problems in general are usually in non-deterministic polynomial time (NP)-hard complexity class. Some NP-hard problems can be easily mapped to minimizing an Ising energy function. Here, we present an analog all-optical implementation of a coherent Ising machine (CIM) based on a network of injection-locked multicore fiber (MCF) lasers. The Zeeman terms and the mutual couplings appearing in the Ising Hamiltonians are implemented using spatial light modulators (SLMs). As a proof-of-principle, we demonstrate the use of optics to solve several Ising Hamiltonians for up to thirteen nodes. Overall, the average accuracy of the CIM to find the ground state energy was ~90% for 120 trials. The fundamental bottlenecks for the scalability and programmability of the presented CIM are discussed as well.