Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization
arXiv:2503.15427 · doi:10.1103/9vbb-h73q
Abstract
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.
References in corpus (33)
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Quantum annealing with more than one hundred qubits
- Defining and detecting quantum speedup
- Network of Time-Multiplexed Optical Parametric Oscillators as a Coherent Ising Machine
- A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
- Large-scale photonic Ising machine by spatial light modulation
- Optimization with Extremal Dynamics
- Realizing the Hamiltonian in polariton simulators
- Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer
- Large-scale Ising spin network based on degenerate optical parametric oscillators
- Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network: Toward quantum soft computing
- Intrinsic optimization using stochastic nanomagnets
- Entanglement in a quantum annealing processor
- Optimized simulated annealing for Ising spin glasses
- Destabilization of local minima in analog spin systems by correction of amplitude heterogeneity
- An electromechanical Ising machine
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Robust quantum optimizer with full connectivity
- Annealing by simulating the coherent Ising machine
- Comparing Monte Carlo methods for finding ground states of Ising spin glasses: population annealing, simulated annealing and parallel tempering
- Coherent Ising machines -- Quantum optics and neural network perspectives
- An event-based architecture for solving constraint satisfaction problems
- Networks of non-equilibrium condensates for global optimization
- Performance evaluation of coherent Ising machines against classical neural networks
- From Near to Eternity: Spin-glass planting, tiling puzzles, and constraint satisfaction problems
- Gaussian Optical Ising Machines
- Directed percolation and numerical stability of simulations of digital memcomputing machines
- Self-Organized Criticality in Glassy Spin Systems Requires a Diverging Number of Neighbors
- Taming a non-convex landscape with dynamical long-range order: memcomputing Ising benchmarks
- Computational hardness of spin-glass problems with tile-planted solutions
- Discrete Polynomial Optimization with Coherent Networks of Condensates and Complex Coupling Switching
- Solving the max-3-cut problem using synchronized dissipative networks