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:2603.13778 · Physical Review Research

Optimality and annealing path planning of dynamical analog solvers

Shu Xi Zhou, K. Y. Michael Wong, Juntao Wang, David Shui Wing Hui, Daniel Ebler, Jie Sun

Published Aug 18, 2026• 0 citations
arXivHTMLPDF

Abstract

Recently proposed analog solvers based on dynamical systems, such as Ising machines, are promising platforms for large-scale combinatorial optimization. Yet, given the heuristic nature of the field, there is very limited insight on optimality guarantees of the solvers, as well as how parameter schedules shape dynamics and outcomes. Here, we develop a dynamical mean-field framework to analyze Ising-machine dynamics for finding the ground-state energy of the Sherrington-Kirkpatrick (SK) model of spin glasses and identify mechanisms that enable rapid convergence to provably near-optimal energies. For a fixed target energy density E c , we show that solutions are typically reached within O ( 1 ) matrix vector multiplications, indicating constant time complexity. We further delineate theoretical limitations arising from different parameter-scheduling trajectories and demonstrate a pronounced benefit of temperature-only annealing for the coherent Ising machine. Building on these insights, we propose a general framework for designing optimized parameter schedules, thereby improving the practical effectiveness of Ising machines for complex optimization tasks. The superior performance of the dynamical solvers is illustrated by the attainment of the ground-state energy of the SK model.

DOI
10.1103/m13m-ys1l

Related papers

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

Performance analysis of classical adiabatic annealing on Ising machines

Jacob Lamers, Guy Verschaffelt, Guy Van der Sande

Ising machines are a promising approach to solve combinatorial optimization problems. They map these problems onto the Ising model and search for low-energy configurations. However, navigating the rugged energy landscapes of these systems remains difficult. To improve this navigation, classical adiabatic annealing has been proposed in the literature as a heuristic optimization method for classical Ising machines. Using this technique, the Hamiltonian of the Ising machine is gradually transformed from an easily solvable Hamiltonian to the target Hamiltonian. However, its purported effectiveness is primarily motivated by an analogy to quantum adiabatic annealing, and systematic benchmarking has remained limited. In this work, we analyze the classical adiabatic annealing technique using continuation methods. Motivated by insights from this analysis, we propose an optimized annealing strategy we refer to as hybrid classical adiabatic annealing. We benchmark our proposed strategy using MaxCut instances with up to 800 spins and problems with external fields, for which it achieves a marginal improvement for a limited set of problems. We conclude that, although theoretically motivated and occasionally beneficial, the hybrid strategy does not offer a sufficient practical advantage over simpler, existing techniques.

quant-pharXiv:2606.07331•Communications Physics•Jun 8, 2026•0 citations

Classical annealing of the Sherrington-Kirkpatrick spin glass using Suzuki-Kubo mean-field Ising dynamics

Soumyaditya Das, Soumyajyoti Biswas, Bikas K. Chakrabarti

We propose and demonstrate numerically a fast classical annealing scheme for the Sherrington-Kirkpatrick (SK) spin glass model, employing the Suzuki-Kubo mean-field Ising dynamics (supplemented by a modified Thouless-Anderson-Palmer reaction field). The resultant dynamics, starting from any arbitrary paramagnetic phase (with local magnetizations m_{i}=±1, for the ith spin, and the global magnetization m=0), takes the system quickly to an appropriate state with small local values of magnetization (m_{i}) commensurate with the (frustrated) interactions. As the temperature decreases with the annealing, the configuration practically remains (in an effective adiabatic way) close to a low-energy configuration as the magnitudes of m_{i}'s and the spin glass order parameter q grow to unity. While the configuration reached by the procedure is not the ground state, for an N-spin SK model (with N up to 10 000), the deviation in the energy per spin E_{N}^{0}-E^{0} found by the annealing procedure scales as N^{-2/3}, with E^{0}=-0.7629±0.0002, suggesting that in the thermodynamic limit the energy per spin of the low-energy configurations converges to the ground state of the SK model (analytical estimate being E^{0}=-0.7631667265⋯), fluctuation σ_{N} in E_{N}^{0} decreases as ∼N^{-3/4}, and the annealing time τ_{N}∼N, making this protocol highly efficient in estimating the ground state energy of the SK model.

arXiv:2412.18358•Physical review. E•Jun 16, 2025•11 citations

A Continuous Energy Ising Machine Leveraging Difference-of-Convex Programming

Banerjee, Debraj, Santanu Mahapatra, Kunal N. Chaudhury

Many combinatorial optimization problems can be reformulated as finding the ground state of the Ising model. Existing Ising solvers are mostly inspired by simulated annealing. Although annealing techniques offer scalability, they lack convergence guarantees and are sensitive to the cooling schedule. We propose solving the Ising problem by relaxing the binary spins to continuous variables and introducing an attraction potential that steers the solution toward binary spin configurations. A key property of this potential is that its combination with the Ising energy produces a Hamiltonian that can be written as a difference of convex polynomials. This enables us to design efficient iterative algorithms that require a single matrix-vector multiplication per iteration and provide convergence guarantees. We implement our Ising solver on a wide range of GPU platforms, from edge devices to high-performance computing clusters, and demonstrate that it consistently outperforms existing solvers across problem sizes ranging from small ($10^3$ spins) to ultra-large ($10^8$ spins).

arXiv:2509.01928•Sep 2, 2025•0 citations

Estimates of ground-state energies for the quantum SK and 2D-EA models, using deGennes–Suzuki–Kubo mean-field annealing dynamics

Soumyaditya Das, Soumyajyoti Biswas, Bikas K. Chakrabarti

We perform large-scale quantum annealing of the Sherrington–Kirkpatrick (SK) spin glass up to a system size N = 40,000 to estimate its ground-state energy using the deGennes–Suzuki–Kubo mean-field quantum Ising dynamics, extending the earlier results (reported in Eur. Phys. J. B 98, 226 (2025)). Here, we numerically solve the deGennes–Suzuki–Kubo annealing dynamics to obtain the spin configurations and subsequently the ground-state energy for a given system size at the end of the annealing, starting from a quantum paramagnetic state. The method shows high efficiency, with an overall algorithmic cost of O ( N 3 ) in estimating the energy of the ground state. We later extend this quantum annealing study to estimate the ground-state energies (starting again from the quantum paramagnetic phase, annealing down to any desired low value of the transverse field) for the Edwards–Anderson (EA) spin glass model on a square lattice.

arXiv:2605.29875•Frontiers in Physics•Nov 12, 2026•0 citations

Energy gap of quantum spin glasses: a projection quantum Monte Carlo study

L. Brodoloni, G. E. Astrakharchik, S. Giorgini +1 more

The performance of quantum annealing for combinatorial optimization is fundamentally limited by the minimum energy gap $Δ$ encountered at quantum phase transitions. We investigate the scaling of $Δ$ with system size $N$ for two paradigmatic quantum spin-glass models: the two-dimensional Edwards-Anderson (2D-EA) and the all-to-all Sherrington-Kirkpatrick (SK) models. Utilizing a newly proposed unbiased energy-gap estimator for continuous-time projection quantum Monte Carlo simulations, complemented by high-performance sparse eigenvalue solvers, we characterize the gap distributions across disorder realizations. It is found that, in the 2D-EA case, the inverse-gap distribution develops a fat tail with infinite variance as $N$ increases. This indicates that the unfavorable super-algebraic scaling of $Δ$, recently reported for binary couplings [Nature 631, 749 (2024)], persists for the Gaussian disorder considered here, pointing to a universal feature of 2D spin glasses. Conversely, the SK model retains a finite-variance distribution, with the disorder-averaged gap following a rather slow power law, close to $Δ\propto N^{-1/3}$. This finding provides a promising outlook for the potential efficiency of quantum annealers for optimization problems with dense connectivity.

cond-mat.dis-nnCross-listedarXiv:2602.20108•Physical Review Letters•Feb 24, 2026•0 citations
Recently proposed analog solvers based on dynamical systems, such as Ising machines, are promising platforms for large-scale combinatorial optimization. Yet, given the heuristic nature of the field, there is very limited insight on optimality guarantees of the solvers, as well as how parameter schedules shape dynamics and outcomes. Here, we develop a dynamical mean-field framework to analyze Ising-machine dynamics for finding the ground-state energy of the Sherrington-Kirkpatrick (SK) model of spin glasses and identify mechanisms that enable rapid convergence to provably near-optimal energies. For a fixed target energy density E c , we show that solutions are typically reached within O ( 1 ) matrix vector multiplications, indicating constant time complexity. We further delineate theoretical limitations arising from different parameter-scheduling trajectories and demonstrate a pronounced benefit of temperature-only annealing for the coherent Ising machine. Building on these insights, we propose a general framework for designing optimized parameter schedules, thereby improving the practical effectiveness of Ising machines for complex optimization tasks. The superior performance of the dynamical solvers is illustrated by the attainment of the ground-state energy of the SK model.
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.
Ising machines are a promising approach to solve combinatorial optimization problems. They map these problems onto the Ising model and search for low-energy configurations. However, navigating the rugged energy landscapes of these systems remains difficult. To improve this navigation, classical adiabatic annealing has been proposed in the literature as a heuristic optimization method for classical Ising machines. Using this technique, the Hamiltonian of the Ising machine is gradually transformed from an easily solvable Hamiltonian to the target Hamiltonian. However, its purported effectiveness is primarily motivated by an analogy to quantum adiabatic annealing, and systematic benchmarking has remained limited. In this work, we analyze the classical adiabatic annealing technique using continuation methods. Motivated by insights from this analysis, we propose an optimized annealing strategy we refer to as hybrid classical adiabatic annealing. We benchmark our proposed strategy using MaxCut instances with up to 800 spins and problems with external fields, for which it achieves a marginal improvement for a limited set of problems. We conclude that, although theoretically motivated and occasionally beneficial, the hybrid strategy does not offer a sufficient practical advantage over simpler, existing techniques.
We propose and demonstrate numerically a fast classical annealing scheme for the Sherrington-Kirkpatrick (SK) spin glass model, employing the Suzuki-Kubo mean-field Ising dynamics (supplemented by a modified Thouless-Anderson-Palmer reaction field). The resultant dynamics, starting from any arbitrary paramagnetic phase (with local magnetizations m_{i}=±1, for the ith spin, and the global magnetization m=0), takes the system quickly to an appropriate state with small local values of magnetization (m_{i}) commensurate with the (frustrated) interactions. As the temperature decreases with the annealing, the configuration practically remains (in an effective adiabatic way) close to a low-energy configuration as the magnitudes of m_{i}'s and the spin glass order parameter q grow to unity. While the configuration reached by the procedure is not the ground state, for an N-spin SK model (with N up to 10 000), the deviation in the energy per spin E_{N}^{0}-E^{0} found by the annealing procedure scales as N^{-2/3}, with E^{0}=-0.7629±0.0002, suggesting that in the thermodynamic limit the energy per spin of the low-energy configurations converges to the ground state of the SK model (analytical estimate being E^{0}=-0.7631667265⋯), fluctuation σ_{N} in E_{N}^{0} decreases as ∼N^{-3/4}, and the annealing time τ_{N}∼N, making this protocol highly efficient in estimating the ground state energy of the SK model.
Many combinatorial optimization problems can be reformulated as finding the ground state of the Ising model. Existing Ising solvers are mostly inspired by simulated annealing. Although annealing techniques offer scalability, they lack convergence guarantees and are sensitive to the cooling schedule. We propose solving the Ising problem by relaxing the binary spins to continuous variables and introducing an attraction potential that steers the solution toward binary spin configurations. A key property of this potential is that its combination with the Ising energy produces a Hamiltonian that can be written as a difference of convex polynomials. This enables us to design efficient iterative algorithms that require a single matrix-vector multiplication per iteration and provide convergence guarantees. We implement our Ising solver on a wide range of GPU platforms, from edge devices to high-performance computing clusters, and demonstrate that it consistently outperforms existing solvers across problem sizes ranging from small (10310^3103 spins) to ultra-large (10810^8108 spins).
We perform large-scale quantum annealing of the Sherrington–Kirkpatrick (SK) spin glass up to a system size N = 40,000 to estimate its ground-state energy using the deGennes–Suzuki–Kubo mean-field quantum Ising dynamics, extending the earlier results (reported in Eur. Phys. J. B 98, 226 (2025)). Here, we numerically solve the deGennes–Suzuki–Kubo annealing dynamics to obtain the spin configurations and subsequently the ground-state energy for a given system size at the end of the annealing, starting from a quantum paramagnetic state. The method shows high efficiency, with an overall algorithmic cost of O ( N 3 ) in estimating the energy of the ground state. We later extend this quantum annealing study to estimate the ground-state energies (starting again from the quantum paramagnetic phase, annealing down to any desired low value of the transverse field) for the Edwards–Anderson (EA) spin glass model on a square lattice.
The performance of quantum annealing for combinatorial optimization is fundamentally limited by the minimum energy gap ΔΔΔ encountered at quantum phase transitions. We investigate the scaling of ΔΔΔ with system size NNN for two paradigmatic quantum spin-glass models: the two-dimensional Edwards-Anderson (2D-EA) and the all-to-all Sherrington-Kirkpatrick (SK) models. Utilizing a newly proposed unbiased energy-gap estimator for continuous-time projection quantum Monte Carlo simulations, complemented by high-performance sparse eigenvalue solvers, we characterize the gap distributions across disorder realizations. It is found that, in the 2D-EA case, the inverse-gap distribution develops a fat tail with infinite variance as NNN increases. This indicates that the unfavorable super-algebraic scaling of ΔΔΔ, recently reported for binary couplings [Nature 631, 749 (2024)], persists for the Gaussian disorder considered here, pointing to a universal feature of 2D spin glasses. Conversely, the SK model retains a finite-variance distribution, with the disorder-averaged gap following a rather slow power law, close to Δ∝N−1/3Δ\propto N^{-1/3}Δ∝N−1/3. This finding provides a promising outlook for the potential efficiency of quantum annealers for optimization problems with dense connectivity.