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

Advanced Physics Research

Topologically Defective Lattice Potential‐Based Gain‐Dissipative Ising Annealer with Large Noise Margin

Zhiqiang Liao, Siyi Tang, Md Shamim Sarker, Hiroyasu Yamahara, Munetoshi Seki, Hitoshi Tabata

Published May 17, 2024• 2 citations
Publisher

Abstract

Abstract Gain‐dissipative Ising machines (GIMs) are annealers inspired by physical systems such as Ising spin glasses to solve combinatorial optimization problems. Compared to traditional quantum annealers, GIM is relatively easier to scale and can save on additional power consumption caused by low‐temperature cooling. However, traditional GIMs have a limited noise margin. Specifically, their normal operation requires ensuring that the noise intensity is lower than their saturation fixed point amplitude, which may result in increased power consumption to suppress noise‐induced spin state switching. To enhance the noise robustness of GIM, in this study a GIM based on a topologically defective lattice potential (TDLP) is proposed. Numerical simulations demonstrate that the TDLP‐based GIM can accurately simulate the bifurcation spin evolution in the Ising model. Furthermore, through the MAXCUT benchmark based on G‐set graphs, the optimal performance of TDLP‐based GIM is shown to surpass that of traditional GIMs. Additionally, the proposed TDLP‐based GIM successfully solves the MAXCUT benchmark and domain clustering dynamics benchmark based on G‐set graphs when the noise intensity exceeds its saturation fixed‐point amplitude. This indicates that the proposed system provides a promising architecture for breaking the small noise constraints required by traditional GIMs.

DOI
10.1002/apxr.202400035

Related papers

Quantum Analog Annealing of Gain‐Dissipative Ising Machine Driven by Colored Gaussian Noise

Zhiqiang Liao, Kaijie Ma, Md Shamim Sarker +4 more

Abstract Gain‐dissipative Ising machines (GIMs) are a type of quantum analog equipment that can rapidly determine the optimal solution for combinatorial optimization problems. When the noise intensity is significantly lower than the fixed point of the system, the performance of a GIM is not influenced by the fluctuation of the noise intensity. However, the noise in this study is limited to Gaussian white noise. The influence of prevalent colored noise on GIMs has not been researched. In this study, the influence of common‐colored noise on the performance of GIMs is numerically investigated. The results of a domain clustering dynamics analysis reveal that red noise can better suppress the generation of the noise‐induced irregular temporary domain. Furthermore, several prevalent MAXCUT problem topologies, including the Moebius ladder, random Moebius ladder, and 2D random lattice, are adopted as test benchmarks. The results reveal that GIMs influenced by white, blue, and violet noise perform better at low‐intensity noise condition. In contrast, pink and red noise‐injected GIMs demonstrate higher performances when applied to MAXCUT topologies with both ferromagnetic and antiferromagnetic connections under larger noise intensity conditions. This indicates that the noise dispersion can be used as an additional hyperparameter to optimize the performance of GIMs.

Advanced Theory and Simulations•Jan 11, 2022•13 citations

Sliding Mode Control‐Like Accelerated Coherent Ising Machine

Zhi‐guo Nie, Ruo‐xing Guo, Chen‐Rui Fan +4 more

Abstract Coherent Ising Machine (CIM) emerge as powerful tools for solving large‐scale combinatorial optimization problems by mapping them to the ground state search of the Ising model. Traditional CIM models face two major challenges when addressing large‐scale problems: slowness in convergence and susceptibility to local minima. To address these limitations, the Sliding Mode Control‐Like Coherent Ising Machine (SMCL‐CIM) integrates sliding mode control principles into the feedback mechanism of the CIM, inspired by classical dynamic control methods. Experimental results on random graphs and G‐set benchmarks demonstrate that for the max‐cut problem, SMCL‐CIM achieves an approximately 79. 93% reduction in solution time while improving solution accuracy by 11.4%–15.3% under the same simulation conditions. This scheme provides an efficient and scalable approach to combinatorial optimization, thereby facilitating the broader application of CIM.

Advanced Quantum Technologies•Apr 8, 2025•1 citation

Oscillator-based Ising machine applied for Max-Cut in massively large and sparse graphs

Luciano Mazza, Eleonora Raimondo, Mario Carpentieri +2 more

Solving large-scale combinatorial optimization problems, such as Max-Cut, is crucial for a variety of applications such as network analysis and finance. Ising machines are emerging as unconventional computing paradigms for facing those problems while promising to reduce energy consumption and time-to-solution as compared to traditional methods such as the Goemans-Williamson algorithm. Here, we implement and benchmark a Graphics Processing Unit (GPU)-native software-based implementation of oscillator-based Ising machine (OIM) which can solve Max-Cut problems up to 20 million spins within a regular graph with degree 25. The benchmarked implementation is running on a single GPU, but it is scalable to multi-GPU platforms. Additionally, we identify an annealing strategy that searches the ground state with the help of dynamical checkpoints as bifurcation points in the dynamical phase space of the Max-Cut problems mapped into the Ising Hamiltonian, enabling the algorithm for a fast local search. The OIM consistently achieves accuracy averaging above 99.5% (up to 99.9%) for G-set problems.

Scientific Reports•Aug 26, 2026•0 citations

Global Mean‐Amplitude Enhanced Spiking Neural Network Coherent Ising Machine

Yan‐Chen Jiang, Lu Ma, Chuan Wang +1 more

ABSTRACT The coherent Ising machine (CIM) is a quantum‐inspired computing platform that leverages optical parametric oscillation dynamics to solve combinatorial optimization problems by searching for the ground state of Ising Hamiltonian. Conventional CIM implementations face challenges in handling non‐uniform coupling strengths and maintaining amplitude stability during computation. In this paper, a new Global mean‐amplitude Feedback‐enhanced spiking neural network CIM (GF‐SNN‐CIM) is introduced with a physics‐driven amplitude stabilization mechanism to dynamically balance nonlinear gain saturation and coupling effects. This modification enhances synchronization in the optical pulse network, leading to more robust convergence under varying interaction strengths. Numerical simulation validation on Max‐Cut problems demonstrates that the GF‐SNN‐CIM achieves improvements in average cut rate compared to conventional spiking neural network CIM. Further application to the traffic assignment problem (TAP) confirms the method's generality. The GF‐SNN‐CIM achieves near‐continuous accuracy (deviations 0.035%) even at coarse discretization, while large‐scale tests on Beijing's road network (481 spins) validate its real‐world applicability. These advances establish a physics‐consistent optimization framework, where optical pulse dynamics directly encode combinatorial problems, paving the way for scalable, high‐performance CIM implementations in complex optimization tasks.

arXiv:2509.13917•Advanced Quantum Technologies•Apr 1, 2026•0 citations

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

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
Abstract Gain‐dissipative Ising machines (GIMs) are annealers inspired by physical systems such as Ising spin glasses to solve combinatorial optimization problems. Compared to traditional quantum annealers, GIM is relatively easier to scale and can save on additional power consumption caused by low‐temperature cooling. However, traditional GIMs have a limited noise margin. Specifically, their normal operation requires ensuring that the noise intensity is lower than their saturation fixed point amplitude, which may result in increased power consumption to suppress noise‐induced spin state switching. To enhance the noise robustness of GIM, in this study a GIM based on a topologically defective lattice potential (TDLP) is proposed. Numerical simulations demonstrate that the TDLP‐based GIM can accurately simulate the bifurcation spin evolution in the Ising model. Furthermore, through the MAXCUT benchmark based on G‐set graphs, the optimal performance of TDLP‐based GIM is shown to surpass that of traditional GIMs. Additionally, the proposed TDLP‐based GIM successfully solves the MAXCUT benchmark and domain clustering dynamics benchmark based on G‐set graphs when the noise intensity exceeds its saturation fixed‐point amplitude. This indicates that the proposed system provides a promising architecture for breaking the small noise constraints required by traditional GIMs.
Abstract Gain‐dissipative Ising machines (GIMs) are a type of quantum analog equipment that can rapidly determine the optimal solution for combinatorial optimization problems. When the noise intensity is significantly lower than the fixed point of the system, the performance of a GIM is not influenced by the fluctuation of the noise intensity. However, the noise in this study is limited to Gaussian white noise. The influence of prevalent colored noise on GIMs has not been researched. In this study, the influence of common‐colored noise on the performance of GIMs is numerically investigated. The results of a domain clustering dynamics analysis reveal that red noise can better suppress the generation of the noise‐induced irregular temporary domain. Furthermore, several prevalent MAXCUT problem topologies, including the Moebius ladder, random Moebius ladder, and 2D random lattice, are adopted as test benchmarks. The results reveal that GIMs influenced by white, blue, and violet noise perform better at low‐intensity noise condition. In contrast, pink and red noise‐injected GIMs demonstrate higher performances when applied to MAXCUT topologies with both ferromagnetic and antiferromagnetic connections under larger noise intensity conditions. This indicates that the noise dispersion can be used as an additional hyperparameter to optimize the performance of GIMs.
Abstract Coherent Ising Machine (CIM) emerge as powerful tools for solving large‐scale combinatorial optimization problems by mapping them to the ground state search of the Ising model. Traditional CIM models face two major challenges when addressing large‐scale problems: slowness in convergence and susceptibility to local minima. To address these limitations, the Sliding Mode Control‐Like Coherent Ising Machine (SMCL‐CIM) integrates sliding mode control principles into the feedback mechanism of the CIM, inspired by classical dynamic control methods. Experimental results on random graphs and G‐set benchmarks demonstrate that for the max‐cut problem, SMCL‐CIM achieves an approximately 79. 93% reduction in solution time while improving solution accuracy by 11.4%–15.3% under the same simulation conditions. This scheme provides an efficient and scalable approach to combinatorial optimization, thereby facilitating the broader application of CIM.
Solving large-scale combinatorial optimization problems, such as Max-Cut, is crucial for a variety of applications such as network analysis and finance. Ising machines are emerging as unconventional computing paradigms for facing those problems while promising to reduce energy consumption and time-to-solution as compared to traditional methods such as the Goemans-Williamson algorithm. Here, we implement and benchmark a Graphics Processing Unit (GPU)-native software-based implementation of oscillator-based Ising machine (OIM) which can solve Max-Cut problems up to 20 million spins within a regular graph with degree 25. The benchmarked implementation is running on a single GPU, but it is scalable to multi-GPU platforms. Additionally, we identify an annealing strategy that searches the ground state with the help of dynamical checkpoints as bifurcation points in the dynamical phase space of the Max-Cut problems mapped into the Ising Hamiltonian, enabling the algorithm for a fast local search. The OIM consistently achieves accuracy averaging above 99.5% (up to 99.9%) for G-set problems.
ABSTRACT The coherent Ising machine (CIM) is a quantum‐inspired computing platform that leverages optical parametric oscillation dynamics to solve combinatorial optimization problems by searching for the ground state of Ising Hamiltonian. Conventional CIM implementations face challenges in handling non‐uniform coupling strengths and maintaining amplitude stability during computation. In this paper, a new Global mean‐amplitude Feedback‐enhanced spiking neural network CIM (GF‐SNN‐CIM) is introduced with a physics‐driven amplitude stabilization mechanism to dynamically balance nonlinear gain saturation and coupling effects. This modification enhances synchronization in the optical pulse network, leading to more robust convergence under varying interaction strengths. Numerical simulation validation on Max‐Cut problems demonstrates that the GF‐SNN‐CIM achieves improvements in average cut rate compared to conventional spiking neural network CIM. Further application to the traffic assignment problem (TAP) confirms the method's generality. The GF‐SNN‐CIM achieves near‐continuous accuracy (deviations 0.035%) even at coarse discretization, while large‐scale tests on Beijing's road network (481 spins) validate its real‐world applicability. These advances establish a physics‐consistent optimization framework, where optical pulse dynamics directly encode combinatorial problems, paving the way for scalable, high‐performance CIM implementations in complex optimization tasks.
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.
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.