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

Nature Communications

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

Masoud Babaeian, Dan Trung Nguyen, Veysi Demir, Mehmetcan Akbulut, Pierre‐Alexandre Blanche, Yushi Kaneda, Saikat Guha, Mark Allen Neifeld, Nasser N. Peyghambarian

Published Aug 6, 2019• 100 citations
Publisher

Abstract

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.

DOI
10.1038/s41467-019-11548-4

Related papers

A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems

Kenta Takata, Alireza Marandi, Ryan Hamerly +6 more

Many tasks in our modern life, such as planning an efficient travel, image processing and optimizing integrated circuit design, are modeled as complex combinatorial optimization problems with binary variables. Such problems can be mapped to finding a ground state of the Ising Hamiltonian, thus various physical systems have been studied to emulate and solve this Ising problem. Recently, networks of mutually injected optical oscillators, called coherent Ising machines, have been developed as promising solvers for the problem, benefiting from programmability, scalability and room temperature operation. Here, we report a 16-bit coherent Ising machine based on a network of time-division-multiplexed femtosecond degenerate optical parametric oscillators. The system experimentally gives more than 99.6% of success rates for one-dimensional Ising ring and nondeterministic polynomial-time (NP) hard instances. The experimental and numerical results indicate that gradual pumping of the network combined with multiple spectral and temporal modes of the femtosecond pulses can improve the computational performance of the Ising machine, offering a new path for tackling larger and more complex instances.

arXiv:1605.03847•Scientific Reports•Sep 23, 2016•87 citations

A coherent Ising machine for 2000-node optimization problems

Takahiro Inagaki, Yoshitaka Haribara, Koji Igarashi +14 more

The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as combinatorial optimization. Many such problems can be mapped onto ground-state search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.

Science•Oct 21, 2016•835 citations

Tackling hard optimization problems with opto-electronic Ising machines

Guy Van der Sande, Toon Sevenants, Jacob Lamers +3 more

With the growing demand for efficient computing to tackle complex real-world challenges like combinatorial optimization, both academia and industry are exploring alternative computing paradigms. The Ising machine (IM) is one such approach, solving optimization problems by mapping their cost functions onto the Ising model. In this framework, finding the optimal solution equates to determining the Ising spin configuration corresponding to the ground state of the Ising Hamiltonian. Analog IMs, relying on artificial spins that can take analogue rather than binary values, have shown great potential in reaching this ground at high speeds. Optical implementations, such as the opto-electronic IM developed within our research group, are particularly promising due to their higher bandwidth, energy efficiency, and lower latency compared to electronic IMs. However, scaling remains a challenge for large problems. To overcome this, we propose a novel analog optical IM utilizing a spatial light modulator (SLM). Our design differs from other IMs relying on SLMs by employing analog spin variables instead of binary ones and leveraging gradient descent-based feedback rather than a computer-driven Metropolis–Hastings sampling process. By exploiting the inherent parallelism of light, this SLM-based IM is expected to efficiently handle optimization problems with millions of spins while still maintaining high energy efficiency. At the conference, we will also offer more insight into the performance of these analogue IMs and will delve deeper in the bit resolution required for the different optical components such as the employed SLM. Based on the dynamical evolution of the IM, we will discuss strategies to further improve the problem-solving capacity and speed of these optical IMs.

Emerging Topics in Artificial Intelligence (ETAI)•Sep 17, 2025•0 citations

ACCELERATED OPTIMIZATION USING COHERENT ISING MACHINES

Kai Yan

Quantum computation takes advantage of quantum physics such as quantum parallelism and quantum interference, to perform calculations in an exponentially parallel way.Quantum computation realizes an exponential speed up over classical computers in solving problems such as factorization.However, the application is severely limited due to the computation model using unitary transformation, and to implement a scalable system remains a challenging task.A new approach that benefits from a coherent quantum system to speed up the search of ground state of Ising model is proposed.The coherent Ising machine is based on one master laser and multiple mutually injection-locked slave lasers, where the master laser locks the optical frequency and phase of all slave lasers to keep the quantum coherence all over the system.The Ising model is implemented by coherent feedback network using optical interference circuits.The ground state of the Ising model corresponds to the polarization configuration with the minimal gain and loss, which emerges spontaneously through the natural mode competition induced by crossgain saturation.The open dissipative system is more robust against noise thus make it more practical to be implemented.A NP-complete problem can be reduced as the Ising model, which provides the proposed system a wider range of applications iv Abstract v compared to the unitary transformation system.In this thesis we introduce the coherent Ising machine using laser network.An efficient mapping of 3 Satisfiability problem (3SAT) to Ising model is proposed.The mapping method reduces a 3SAT problem with N variables to an Ising model with N spins, which can be implemented using a system with N slave lasers.We also propose a Binary search method to determine the optimal pumping power which provides the highest probability of finding the ground state in O(logM ) steps for a 3SAT problem with M clauses.Simulations using different sized 3SAT problems are investigated and from which we find the computation time scaling with input problem size is reduced to O(N 3 ) with the optimal pumping rate.

•Sep 27, 2013•0 citations

Single photon coherent Ising machines for constrained optimization problems

Masahito Kumagai, Yoshitaka Inui, Edwin Ng +4 more

Abstract A Coherent Ising machine (CIM) is an oscillator-network-based analog computing system to circumvent the bottleneck in von Neumann digital computing architectures. The CIM consists of a network of degenerate optical parametric oscillators (DOPOs) and is designed to find a ground state or perform Boltzmann sampling for all degenerate ground states and low-energy excited states in combinatorial optimization problems. A nonlinear measurement feedback scheme, called chaotic amplitude control (CAC), has recently been proposed to correct pulse amplitude inhomogeneity and thereby faithfully map the Ising Hamiltonian to the loss landscape of the DOPO network. However, the quantum limit of the CIM-CAC performance is not fully explored yet. This work clarifies how the quantum noise squeezing and the measurement-induced state shift in repeated indirect quantum measurements improve the system performance. From the numerical simulation on the Ising model with the Zeeman terms, obtained from combinatorial clustering problems formulated as constrained optimization problems, it is revealed that the CIM-CAC operating in a single photon per pulse regime dramatically outperforms the standard CIM-CAC with a large photon number per pulse. This is because the standard CIM-CAC is often trapped in a periodic trajectory and cannot escape from there. On the other hand, the significant improvement is brought by the noise-induced amplitude jump in the single photon CIM-CAC.

Quantum Science and Technology•May 28, 2025•3 citations

Combinatorial Optimization with Coherent Ising Machines based on Degenerate Optical Parametric Oscillators

Y. Yamamoto

The basic concept, principle and implementation of coherent Ising machines are presented. A fully programmable 100 spin machine with all-to-all connections solves ground states and randomly samples low-energy excited states of NP-hard Ising problems.

Frontiers in Optics•Jan 1, 2016•0 citations
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.
Many tasks in our modern life, such as planning an efficient travel, image processing and optimizing integrated circuit design, are modeled as complex combinatorial optimization problems with binary variables. Such problems can be mapped to finding a ground state of the Ising Hamiltonian, thus various physical systems have been studied to emulate and solve this Ising problem. Recently, networks of mutually injected optical oscillators, called coherent Ising machines, have been developed as promising solvers for the problem, benefiting from programmability, scalability and room temperature operation. Here, we report a 16-bit coherent Ising machine based on a network of time-division-multiplexed femtosecond degenerate optical parametric oscillators. The system experimentally gives more than 99.6% of success rates for one-dimensional Ising ring and nondeterministic polynomial-time (NP) hard instances. The experimental and numerical results indicate that gradual pumping of the network combined with multiple spectral and temporal modes of the femtosecond pulses can improve the computational performance of the Ising machine, offering a new path for tackling larger and more complex instances.
The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as combinatorial optimization. Many such problems can be mapped onto ground-state search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.
With the growing demand for efficient computing to tackle complex real-world challenges like combinatorial optimization, both academia and industry are exploring alternative computing paradigms. The Ising machine (IM) is one such approach, solving optimization problems by mapping their cost functions onto the Ising model. In this framework, finding the optimal solution equates to determining the Ising spin configuration corresponding to the ground state of the Ising Hamiltonian. Analog IMs, relying on artificial spins that can take analogue rather than binary values, have shown great potential in reaching this ground at high speeds. Optical implementations, such as the opto-electronic IM developed within our research group, are particularly promising due to their higher bandwidth, energy efficiency, and lower latency compared to electronic IMs. However, scaling remains a challenge for large problems. To overcome this, we propose a novel analog optical IM utilizing a spatial light modulator (SLM). Our design differs from other IMs relying on SLMs by employing analog spin variables instead of binary ones and leveraging gradient descent-based feedback rather than a computer-driven Metropolis–Hastings sampling process. By exploiting the inherent parallelism of light, this SLM-based IM is expected to efficiently handle optimization problems with millions of spins while still maintaining high energy efficiency. At the conference, we will also offer more insight into the performance of these analogue IMs and will delve deeper in the bit resolution required for the different optical components such as the employed SLM. Based on the dynamical evolution of the IM, we will discuss strategies to further improve the problem-solving capacity and speed of these optical IMs.
Quantum computation takes advantage of quantum physics such as quantum parallelism and quantum interference, to perform calculations in an exponentially parallel way.Quantum computation realizes an exponential speed up over classical computers in solving problems such as factorization.However, the application is severely limited due to the computation model using unitary transformation, and to implement a scalable system remains a challenging task.A new approach that benefits from a coherent quantum system to speed up the search of ground state of Ising model is proposed.The coherent Ising machine is based on one master laser and multiple mutually injection-locked slave lasers, where the master laser locks the optical frequency and phase of all slave lasers to keep the quantum coherence all over the system.The Ising model is implemented by coherent feedback network using optical interference circuits.The ground state of the Ising model corresponds to the polarization configuration with the minimal gain and loss, which emerges spontaneously through the natural mode competition induced by crossgain saturation.The open dissipative system is more robust against noise thus make it more practical to be implemented.A NP-complete problem can be reduced as the Ising model, which provides the proposed system a wider range of applications iv Abstract v compared to the unitary transformation system.In this thesis we introduce the coherent Ising machine using laser network.An efficient mapping of 3 Satisfiability problem (3SAT) to Ising model is proposed.The mapping method reduces a 3SAT problem with N variables to an Ising model with N spins, which can be implemented using a system with N slave lasers.We also propose a Binary search method to determine the optimal pumping power which provides the highest probability of finding the ground state in O(logM ) steps for a 3SAT problem with M clauses.Simulations using different sized 3SAT problems are investigated and from which we find the computation time scaling with input problem size is reduced to O(N 3 ) with the optimal pumping rate.
Abstract A Coherent Ising machine (CIM) is an oscillator-network-based analog computing system to circumvent the bottleneck in von Neumann digital computing architectures. The CIM consists of a network of degenerate optical parametric oscillators (DOPOs) and is designed to find a ground state or perform Boltzmann sampling for all degenerate ground states and low-energy excited states in combinatorial optimization problems. A nonlinear measurement feedback scheme, called chaotic amplitude control (CAC), has recently been proposed to correct pulse amplitude inhomogeneity and thereby faithfully map the Ising Hamiltonian to the loss landscape of the DOPO network. However, the quantum limit of the CIM-CAC performance is not fully explored yet. This work clarifies how the quantum noise squeezing and the measurement-induced state shift in repeated indirect quantum measurements improve the system performance. From the numerical simulation on the Ising model with the Zeeman terms, obtained from combinatorial clustering problems formulated as constrained optimization problems, it is revealed that the CIM-CAC operating in a single photon per pulse regime dramatically outperforms the standard CIM-CAC with a large photon number per pulse. This is because the standard CIM-CAC is often trapped in a periodic trajectory and cannot escape from there. On the other hand, the significant improvement is brought by the noise-induced amplitude jump in the single photon CIM-CAC.