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:1805.01371 · New Journal of Physics

Networks of non-equilibrium condensates for global optimization

Kirill P. Kalinin, Natalia G. Berloff

Published Oct 16, 2018• 51 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1367-2630/aae8ae

Related papers

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

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

Nikita Stroev, Natalia G. Berloff

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.

arXiv:1910.00842•Physical Review Letters•Feb 5, 2021•17 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

Spin Simulators based on Exciton-Polariton Waveguide Networks

Kevin Dini, Simone Zanotti, T. C. H. Liew

Many NP-hard optimization problems can be mapped onto interacting spin systems, whose ground state encodes the optimal solution. Polaritonic implementations based on gain-dissipative dynamics have recently emerged as promising analog computing platforms owing to their intrinsic parallelism and ultrafast operation. However, existing approaches are hindered by two fundamental limitations: maintaining the homogeneous amplitudes required for faithful problem encoding remains challenging in realistic physical systems, and most architectures are restricted to nearest-neighbour interactions, severely limiting the variety of optimization problems that can be efficiently addressed. We introduce a feasible polaritonic XY simulator based on a reconfigurable waveguide platform that overcomes both limitations. Our approach guarantees amplitude homogeneity while enabling the implementa- tion of arbitrary symmetric coupling matrices, thereby allowing the direct encoding of a wide variety of XY Hamiltonians. These results establish a practical architecture for programmable polaritonic spin simulators and pave the way towards scalable optical hardware for analog optimisation.

arXiv:2611.06087•Nov 4, 2026•1 citation

Quantum Simulation of Dissipative Non-Markovian Coupled Classical Oscillators

Malte Schade, Sophia Simon, Nathan Wiebe +3 more

We present a quantum algorithm for simulating classical oscillator networks characterized by non-Markovian dissipation and time-varying material properties, extending recent speedups for undamped harmonic systems to viscoacoustic and viscoelastic media. We embed the history-dependent dynamics into a Markovian state space governed by a non-Hermitian operator by approximating memory kernels through a Prony series. We then use linear combination of Hamiltonian simulation to estimate the instantaneous kinetic and potential energy for a subset of oscillators at time $t$ within error $ε$ using a number of queries to the oscillator system that scales as $\widetilde{\mathcal{O}}(α_{\rm tot} t/ε)$, where $α_{\rm tot}$ is polynomial in the strength of the dissipation, spring constants, inverse masses, and sparsity of the connections in the network. We further show that this energy estimation task is in the worst-case classically hard (i.e., a corresponding decision problem is $\mathsf{BQP}$-complete), even in the presence of strong dissipation. For time-dependent materials, we show that changes in material properties appear as effective dissipation or growth in the energy representation. Additionally, we prove the infeasibility of exponential quantum advantages in locally coupled topologies through a novel form of Lieb-Robinson-like bounds that apply to differential equations. This allows our quantum algorithms to provide quartic speedups for locally coupled damped oscillator systems in three dimensions, raising the possibility of practical quantum speedups for realistically damped oscillator networks and approximated wave equations.

quant-pharXiv:2609.20721•Sep 18, 2026•1 citation
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.
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.
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.
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.
Many NP-hard optimization problems can be mapped onto interacting spin systems, whose ground state encodes the optimal solution. Polaritonic implementations based on gain-dissipative dynamics have recently emerged as promising analog computing platforms owing to their intrinsic parallelism and ultrafast operation. However, existing approaches are hindered by two fundamental limitations: maintaining the homogeneous amplitudes required for faithful problem encoding remains challenging in realistic physical systems, and most architectures are restricted to nearest-neighbour interactions, severely limiting the variety of optimization problems that can be efficiently addressed. We introduce a feasible polaritonic XY simulator based on a reconfigurable waveguide platform that overcomes both limitations. Our approach guarantees amplitude homogeneity while enabling the implementa- tion of arbitrary symmetric coupling matrices, thereby allowing the direct encoding of a wide variety of XY Hamiltonians. These results establish a practical architecture for programmable polaritonic spin simulators and pave the way towards scalable optical hardware for analog optimisation.
We present a quantum algorithm for simulating classical oscillator networks characterized by non-Markovian dissipation and time-varying material properties, extending recent speedups for undamped harmonic systems to viscoacoustic and viscoelastic media. We embed the history-dependent dynamics into a Markovian state space governed by a non-Hermitian operator by approximating memory kernels through a Prony series. We then use linear combination of Hamiltonian simulation to estimate the instantaneous kinetic and potential energy for a subset of oscillators at time ttt within error εεε using a number of queries to the oscillator system that scales as O~(αtott/ε)\widetilde{\mathcal{O}}(α_{\rm tot} t/ε)O(αtot​t/ε), where αtotα_{\rm tot}αtot​ is polynomial in the strength of the dissipation, spring constants, inverse masses, and sparsity of the connections in the network. We further show that this energy estimation task is in the worst-case classically hard (i.e., a corresponding decision problem is BQP\mathsf{BQP}BQP-complete), even in the presence of strong dissipation. For time-dependent materials, we show that changes in material properties appear as effective dissipation or growth in the energy representation. Additionally, we prove the infeasibility of exponential quantum advantages in locally coupled topologies through a novel form of Lieb-Robinson-like bounds that apply to differential equations. This allows our quantum algorithms to provide quartic speedups for locally coupled damped oscillator systems in three dimensions, raising the possibility of practical quantum speedups for realistically damped oscillator networks and approximated wave equations.