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

arXiv:1910.00842 · Physical Review Letters

Discrete Polynomial Optimization with Coherent Networks of Condensates and Complex Coupling Switching

Nikita Stroev, Natalia G. Berloff

Published Feb 5, 2021• 17 citations
arXivHTMLPDF

Abstract

Gain-dissipative platforms consisting of lasers, optical parametric oscillators and nonequilibrium condensates operating at the condensation or coherence threshold have been recently proposed as efficient analog simulators of the two-local spin Hamiltonians with continuous or discrete degrees of freedom. We show that nonequilibrium condensates above the threshold arranged in an interacting network may realize k-local Hamiltonians with k>2 and lead to nontrivial phase configurations. Similarly, many gain-dissipative systems that can be manipulated by optical means can bring about the ground state of the k-local Hamiltonians and solve higher-order binary optimization problems. We show how to facilitate the search for the global solution by invoking complex couplings in the system and demonstrate the efficiency of the method on the sets of complex problems. This approach offers a highly flexible new kind of computation based on gain-dissipative simulators with complex coupling switching.

DOI
10.1103/physrevlett.126.050504

Related papers

Networks of non-equilibrium condensates for global optimization

Kirill P. Kalinin, Natalia G. Berloff

Recently several gain-dissipative platforms based on the networks of optical parametric oscillators, lasers and various non-equilibrium Bose–Einstein condensates have been proposed and realised as analogue Hamiltonian simulators for solving large-scale hard optimisation problems. However, in these realisations the parameters of the problem depend on the node occupancies that are not known a priori , which limits the applicability of the gain-dissipative simulators to the classes of problems easily solvable by classical computations. We show how to overcome this difficulty and formulate the principles of operation of such simulators for solving the NP-hard large-scale optimisation problems such as constant modulus continuous quadratic optimisation and quadratic binary optimisation for any general matrix. To solve such problems any gain-dissipative simulator has to implement a feedback mechanism for the dynamical adjustment of the gain and coupling strengths.

arXiv:1805.01371•New Journal of Physics•Oct 16, 2018•51 citations

Simulating Ising and n -State Planar Potts Models and External Fields with Nonequilibrium Condensates

Kirill P. Kalinin, Natalia G. Berloff

Classical spin models with discrete or continuous degrees of freedom arise in many studies of complex physical systems. A wide class of hard real-life optimization problems can be formulated as a minimization of a spin Hamiltonian. Here we show how to simulate the discrete Ising and n-state planar Potts models with or without external fields using the physical gain-dissipative platforms with continuous phases, such as lasers and various nonequilibrium Bose-Einstein condensates. The underlying operational principle originates from a combination of resonant and nonresonant pumping. Our results lay grounds for the physical simulations of a broad range of Hamiltonians with complex interactions that can vary in time and space and with combined symmetries.

arXiv:1806.11457•Physical Review Letters•Dec 4, 2018•61 citations

Gain-dissipative simulators for large-scale hard classical optimisation

Kirill P. Kalinin, Natalia G. Berloff

Recently several gain-dissipative platforms based on the network of optical parametric oscillators, lasers and various non-equilibrium Bose-Einstein condensates have been proposed as analog Hamiltonian simulators for solving large-scale hard optimisation problems. The parameters of such problems depend on the node occupancies that are not a priory known, which limits the applicability of the gain-dissipative simulators to the classes of problems easily solvable by classical computations. We show how to overcome this difficulty and formulate algorithms for solving the NP-hard large-scale optimisation problems such as constant modulus continuous quadratic optimisation for any general matrix. We show that to solve such problems any gain-dissipative simulator has to implement a feedback mechanism for the dynamical adjustment of the gain, so that occupancy of each node is the same. Based on the principle of operation of such simulators we propose a novel class of classical gain-dissipative algorithms and show its advantage in comparison with classical algorithms. The estimates of the time operation of the physical implementation of the gain-dissipative simulators for large matrices show the speed-up of the several orders of magnitude in comparison with classical computations.

•Apr 24, 2018•3 citations

Global optimization of spin Hamiltonians with gain-dissipative systems

Kirill P. Kalinin, Natalia G. Berloff

Recently, several platforms were proposed and demonstrated a proof-of-principle for finding the global minimum of the spin Hamiltonians such as the Ising and XY models using gain-dissipative quantum and classical systems. The implementation of dynamical adjustment of the gain and coupling strengths has been established as a vital feedback mechanism for analog Hamiltonian physical systems that aim to simulate spin Hamiltonians. Based on the principle of operation of such simulators we develop a novel class of gain-dissipative algorithms for global optimisation of NP-hard problems and show its performance in comparison with the classical global optimisation algorithms. These systems can be used to study the ground state and statistical properties of spin systems and as a direct benchmark for the performance testing of the gain-dissipative physical simulators. Our theoretical and numerical estimations suggest that for large problem sizes the analog simulator when built might outperform the classical computer computations by several orders of magnitude under certain assumptions about the simulator operation.

arXiv:1807.00699•Scientific Reports•Dec 6, 2018•64 citations

Accelerating a coherent Ising machine by XY-Ising spin transition

Kyungduk Kim, Y. Yamamoto

We numerically demonstrate that introducing XY-spin dynamics enabled by phase-insensitive optical parametric gain enhances the performance of coherent Ising machines (CIMs). Whereas conventional CIMs based on phase-sensitive optical parametric gain confine spins to two discrete Ising states, nondegenerate optical parametric oscillators with phase-insensitive gain support continuous-phase XY spins, facilitating spin flips that enable the system to escape local minima. Benchmarking on Wishart-planted problem instances shows that gradually transitioning from XY to Ising spins reduces the time-to-solution by roughly an order of magnitude relative to purely Ising-based dynamics. Furthermore, tailoring the transitions between XY-like and Ising-like regimes yields additional improvements beyond a simple unidirectional XY-to-Ising transition. Our results establish a new framework for engineering CIM dynamics in full phase-quadrature space and point toward fully optical architectures for efficient combinatorial optimization.

Scientific Reports•Feb 24, 2026•0 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
Gain-dissipative platforms consisting of lasers, optical parametric oscillators and nonequilibrium condensates operating at the condensation or coherence threshold have been recently proposed as efficient analog simulators of the two-local spin Hamiltonians with continuous or discrete degrees of freedom. We show that nonequilibrium condensates above the threshold arranged in an interacting network may realize k-local Hamiltonians with k>2 and lead to nontrivial phase configurations. Similarly, many gain-dissipative systems that can be manipulated by optical means can bring about the ground state of the k-local Hamiltonians and solve higher-order binary optimization problems. We show how to facilitate the search for the global solution by invoking complex couplings in the system and demonstrate the efficiency of the method on the sets of complex problems. This approach offers a highly flexible new kind of computation based on gain-dissipative simulators with complex coupling switching.
Recently several gain-dissipative platforms based on the networks of optical parametric oscillators, lasers and various non-equilibrium Bose–Einstein condensates have been proposed and realised as analogue Hamiltonian simulators for solving large-scale hard optimisation problems. However, in these realisations the parameters of the problem depend on the node occupancies that are not known a priori , which limits the applicability of the gain-dissipative simulators to the classes of problems easily solvable by classical computations. We show how to overcome this difficulty and formulate the principles of operation of such simulators for solving the NP-hard large-scale optimisation problems such as constant modulus continuous quadratic optimisation and quadratic binary optimisation for any general matrix. To solve such problems any gain-dissipative simulator has to implement a feedback mechanism for the dynamical adjustment of the gain and coupling strengths.
Classical spin models with discrete or continuous degrees of freedom arise in many studies of complex physical systems. A wide class of hard real-life optimization problems can be formulated as a minimization of a spin Hamiltonian. Here we show how to simulate the discrete Ising and n-state planar Potts models with or without external fields using the physical gain-dissipative platforms with continuous phases, such as lasers and various nonequilibrium Bose-Einstein condensates. The underlying operational principle originates from a combination of resonant and nonresonant pumping. Our results lay grounds for the physical simulations of a broad range of Hamiltonians with complex interactions that can vary in time and space and with combined symmetries.
Recently several gain-dissipative platforms based on the network of optical parametric oscillators, lasers and various non-equilibrium Bose-Einstein condensates have been proposed as analog Hamiltonian simulators for solving large-scale hard optimisation problems. The parameters of such problems depend on the node occupancies that are not a priory known, which limits the applicability of the gain-dissipative simulators to the classes of problems easily solvable by classical computations. We show how to overcome this difficulty and formulate algorithms for solving the NP-hard large-scale optimisation problems such as constant modulus continuous quadratic optimisation for any general matrix. We show that to solve such problems any gain-dissipative simulator has to implement a feedback mechanism for the dynamical adjustment of the gain, so that occupancy of each node is the same. Based on the principle of operation of such simulators we propose a novel class of classical gain-dissipative algorithms and show its advantage in comparison with classical algorithms. The estimates of the time operation of the physical implementation of the gain-dissipative simulators for large matrices show the speed-up of the several orders of magnitude in comparison with classical computations.
Recently, several platforms were proposed and demonstrated a proof-of-principle for finding the global minimum of the spin Hamiltonians such as the Ising and XY models using gain-dissipative quantum and classical systems. The implementation of dynamical adjustment of the gain and coupling strengths has been established as a vital feedback mechanism for analog Hamiltonian physical systems that aim to simulate spin Hamiltonians. Based on the principle of operation of such simulators we develop a novel class of gain-dissipative algorithms for global optimisation of NP-hard problems and show its performance in comparison with the classical global optimisation algorithms. These systems can be used to study the ground state and statistical properties of spin systems and as a direct benchmark for the performance testing of the gain-dissipative physical simulators. Our theoretical and numerical estimations suggest that for large problem sizes the analog simulator when built might outperform the classical computer computations by several orders of magnitude under certain assumptions about the simulator operation.
We numerically demonstrate that introducing XY-spin dynamics enabled by phase-insensitive optical parametric gain enhances the performance of coherent Ising machines (CIMs). Whereas conventional CIMs based on phase-sensitive optical parametric gain confine spins to two discrete Ising states, nondegenerate optical parametric oscillators with phase-insensitive gain support continuous-phase XY spins, facilitating spin flips that enable the system to escape local minima. Benchmarking on Wishart-planted problem instances shows that gradually transitioning from XY to Ising spins reduces the time-to-solution by roughly an order of magnitude relative to purely Ising-based dynamics. Furthermore, tailoring the transitions between XY-like and Ising-like regimes yields additional improvements beyond a simple unidirectional XY-to-Ising transition. Our results establish a new framework for engineering CIM dynamics in full phase-quadrature space and point toward fully optical architectures for efficient combinatorial optimization.
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.