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

Global optimization of spin Hamiltonians with gain-dissipative systems

Natalia G. Berloff, Kirill P. Kalinin

Published Jan 17, 2019• 57 citations
Publisher

Abstract

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.

DOI
10.17863/cam.35399

Related papers

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•8 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•4 citations

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•56 citations

Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization

Junpeng Hou, Amin Barzegar, Helmut G. Katzgraber

Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search of the Ising model, tremendous effort has been devoted to developing solvers for Ising-type problems over the past decades. Recent advances in controlling and manipulating both quantum and classical systems have enabled novel computing paradigms such as quantum simulators and coherent Ising machines to tackle hard optimization problems. Here, we examine and benchmark several physics-inspired optimization algorithms, including coherent Ising machines, gain-dissipative algorithms, simulated bifurcation machines, and Hopfield neural networks, which we collectively refer to as stochastic driven nonlinear dynamical systems. Most importantly, we benchmark these algorithms against random Ising problems with planted solutions and compare them to simulated annealing as a baseline leveraging the same software stack for all solvers. We further study how different numerical integration techniques and graph connectivity affect performance. This work provides an overview of a diverse set of new optimization paradigms.

arXiv:2503.15427•Physical review. E•Jul 1, 2025•1 citation

Combinatorial optimization with dual mean-field dynamics

Wenbiao Xu, Zi-Song Shen, Ying Tang +1 more

Abstract Combinatorial optimization problems and ground state problems of spin glasses are crucial in various fields of science and technology. However, they often belong to the computational class of NP-hard, presenting significant computational challenges. Traditional algorithms inspired by statistical physics like simulated annealing have been widely adopted. Recently, advancements in Ising machines, such as quantum annealers and coherent Ising machines, offer new paradigms for solving these problems efficiently by embedding them into the analog evolution of nonlinear dynamical systems. However, existing dynamics-based algorithms often suffer from low convergence rates and local minima traps. In this work, we introduce the dual mean-field dynamics into Ising machines. The approach integrates the gradient force and the transverse force into the dynamics of Ising machines in solving combinatorial optimization problems, making it easier for the system to jump out of the local minimums and allowing the dynamics to explore wider in configuration space. We conduct extensive numerical experiments using the Sherrington–Kirkpatrick spin glass up to 10 000 spins and the maximum cut problems with the standard G-set benchmarks. The numerical results demonstrate that our dual mean-field dynamics approach enhances the performance of base Ising machines, providing a more effective solution for large-scale combinatorial optimization problems.

Communications in Theoretical Physics•Apr 2, 2025•1 citation
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.
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.
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 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.
Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search of the Ising model, tremendous effort has been devoted to developing solvers for Ising-type problems over the past decades. Recent advances in controlling and manipulating both quantum and classical systems have enabled novel computing paradigms such as quantum simulators and coherent Ising machines to tackle hard optimization problems. Here, we examine and benchmark several physics-inspired optimization algorithms, including coherent Ising machines, gain-dissipative algorithms, simulated bifurcation machines, and Hopfield neural networks, which we collectively refer to as stochastic driven nonlinear dynamical systems. Most importantly, we benchmark these algorithms against random Ising problems with planted solutions and compare them to simulated annealing as a baseline leveraging the same software stack for all solvers. We further study how different numerical integration techniques and graph connectivity affect performance. This work provides an overview of a diverse set of new optimization paradigms.
Abstract Combinatorial optimization problems and ground state problems of spin glasses are crucial in various fields of science and technology. However, they often belong to the computational class of NP-hard, presenting significant computational challenges. Traditional algorithms inspired by statistical physics like simulated annealing have been widely adopted. Recently, advancements in Ising machines, such as quantum annealers and coherent Ising machines, offer new paradigms for solving these problems efficiently by embedding them into the analog evolution of nonlinear dynamical systems. However, existing dynamics-based algorithms often suffer from low convergence rates and local minima traps. In this work, we introduce the dual mean-field dynamics into Ising machines. The approach integrates the gradient force and the transverse force into the dynamics of Ising machines in solving combinatorial optimization problems, making it easier for the system to jump out of the local minimums and allowing the dynamics to explore wider in configuration space. We conduct extensive numerical experiments using the Sherrington–Kirkpatrick spin glass up to 10 000 spins and the maximum cut problems with the standard G-set benchmarks. The numerical results demonstrate that our dual mean-field dynamics approach enhances the performance of base Ising machines, providing a more effective solution for large-scale combinatorial optimization problems.