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

The Japan Society of Applied Physics

Combinatorial optimization with coherent Ising machine

Takahiro Inagaki

Published Jul 10, 2018• 0 citations
OpenAlex

Related papers

A coherent Ising machine for solving complex combinatorial optimization problems

Hiroki Takesue

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

Optical oscillator network for solving combinatorial optimization problems -- Coherent Ising machine

Shoko Utsunomiya, Shuhei Tamate, Yoshitaka Haribara +6 more

IEICE Technical Report; IEICE Tech. Rep.•Jun 6, 2016•0 citations

Sliding Mode Control‐Like Accelerated Coherent Ising Machine

Zhi‐guo Nie, Ruo‐xing Guo, Chen‐Rui Fan +4 more

Abstract Coherent Ising Machine (CIM) emerge as powerful tools for solving large‐scale combinatorial optimization problems by mapping them to the ground state search of the Ising model. Traditional CIM models face two major challenges when addressing large‐scale problems: slowness in convergence and susceptibility to local minima. To address these limitations, the Sliding Mode Control‐Like Coherent Ising Machine (SMCL‐CIM) integrates sliding mode control principles into the feedback mechanism of the CIM, inspired by classical dynamic control methods. Experimental results on random graphs and G‐set benchmarks demonstrate that for the max‐cut problem, SMCL‐CIM achieves an approximately 79. 93% reduction in solution time while improving solution accuracy by 11.4%–15.3% under the same simulation conditions. This scheme provides an efficient and scalable approach to combinatorial optimization, thereby facilitating the broader application of CIM.

Advanced Quantum Technologies•Apr 8, 2025•1 citation

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

Solving complex optimization problems with a coherent Ising machine

Hiroki Takesue, Takahiro Inagaki, Toshimori Honjo

SPIE Newsroom•Jul 19, 2017•0 citations

Physical coherent Ising machines for solving combinatorial optimization problems

Yoonhyuk Rah, Kyoungsik Yu

Abstract Coherent Ising machines (CIM) have shown promising potential as hardware solvers for tackling combinatorial optimization problems, where discrete variables are encoded onto physical states to form an Ising Hamiltonian. Various platforms, starting from optical parametric oscillators, have been proposed and demonstrated to implement an actual physical CIM. In this review article, we briefly introduce the basic operation principle of CIMs and review physical schemes focusing on MEMS-based nanophotonics.

Japanese Journal of Applied Physics•Feb 27, 2026•1 citation
Abstract Coherent Ising Machine (CIM) emerge as powerful tools for solving large‐scale combinatorial optimization problems by mapping them to the ground state search of the Ising model. Traditional CIM models face two major challenges when addressing large‐scale problems: slowness in convergence and susceptibility to local minima. To address these limitations, the Sliding Mode Control‐Like Coherent Ising Machine (SMCL‐CIM) integrates sliding mode control principles into the feedback mechanism of the CIM, inspired by classical dynamic control methods. Experimental results on random graphs and G‐set benchmarks demonstrate that for the max‐cut problem, SMCL‐CIM achieves an approximately 79. 93% reduction in solution time while improving solution accuracy by 11.4%–15.3% under the same simulation conditions. This scheme provides an efficient and scalable approach to combinatorial optimization, thereby facilitating the broader application of CIM.
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.
Abstract Coherent Ising machines (CIM) have shown promising potential as hardware solvers for tackling combinatorial optimization problems, where discrete variables are encoded onto physical states to form an Ising Hamiltonian. Various platforms, starting from optical parametric oscillators, have been proposed and demonstrated to implement an actual physical CIM. In this review article, we briefly introduce the basic operation principle of CIMs and review physical schemes focusing on MEMS-based nanophotonics.