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:2411.02010 · Physical Review Applied

Complex vector gain-based annealer for minimizing X Y Hamiltonians

James Cummins, Natalia G. Berloff

Published Jan 20, 2026• 3 citations
arXivHTMLPDF

Abstract

. We present the complex vector gain-based annealer (CVGA), an analog computing platform designed to overcome energy barriers in X Y Hamiltonians through a higher-dimensional representation. Traditional gain-based solvers using optical or photonic hardware typically represent each X Y spin with a single complex field. These solvers often struggle with large energy barriers in complex landscapes, leading to relaxation into excited states. CVGA addresses these limitations by using two complex fields to represent each X Y spin and dynamically evolving the energy landscape through time-dependent annealing. Operating in a higher-dimensional space, CVGA bridges energy barriers in this expanded space during the continuous phase evolution, thus avoiding entrapment in local minima. We introduce several graph structures that pose challenges for X Y minimization and use them to benchmark CVGA against single-dimension X Y solvers, highlighting the benefits of higher-dimensional operation.

DOI
10.1103/lpwn-t7sv

Related papers

Vector Ising spin annealer for minimizing Ising Hamiltonians

James Cummins, Natalia G. Berloff

Abstract Complex optimization problems can be solved via dedicated machines which encode the problem in the couplings of spin Hamiltonians. However, traditional physical minimizers often select excited states due to limitations in spin dynamics. We introduce the Vector Ising Spin Annealer (VISA), a framework in gain-based computing that leverages light-matter interactions. We show that VISA overcomes the limitations by enabling spins to operate within a three-dimensional space, thereby providing a robust solution for effectively minimizing Ising Hamiltonians. Our comparative analysis demonstrates VISA’s superior performance relative to conventional single-dimension spin optimizers, highlighting its capacity to surmount significant energy barriers in intricate landscapes. Detailed studies on cyclic and random graphs reveal VISA’s proficiency in dynamically evolving the energy landscape through time-dependent gain and penalty annealing, underscoring its potential in advancing the field of complex problem-solving in physics-inspired and physics-based computing.

arXiv:2403.16608•Communications Physics•May 29, 2025•15 citations

Ising Hamiltonian minimization: Gain-based computing with manifold reduction of soft spins vs quantum annealing

James Cummins, Hayder Salman, Natalia G. Berloff

We investigate the minimization of Ising Hamiltonians, comparing the performance of gain-based computing paradigms based on the dynamics of semiclassical soft-spin models with quantum annealing. We systematically analyze how the energy landscape for the circulant couplings of a Möbius graph evolves with increased annealing parameters. Our findings indicate that these semiclassical models face challenges due to a widening dimensionality landscape. To counteract this issue, we introduce the manifold reduction method, which restricts the soft-spin amplitudes to a defined phase space region. Concurrently, quantum annealing demonstrates a natural capability to navigate the Ising Hamiltonian's energy landscape due to its operation within the comprehensive Hilbert space. Our study indicates that physics-inspired or physics-enhanced optimizers will likely benefit from combining classical and quantum annealing techniques.

arXiv:2311.17359•Physical Review Research•Feb 11, 2025•16 citations

Soft vector spins with dimensional annealing for combinatorial optimization

Marvin Syed, Richard Zhipeng Wang, Natalia G. Berloff

Recently, purpose-built analog hardware that can efficiently minimize the Ising energy and thereby solve a variety of combinatorial optimization problems has been receiving widespread attention. In this work, we show how multidimensional, vectorial degrees of freedom, that are either naturally present or can be artificially created in such hardware, could strengthen the capability to find optimal solutions to optimization problems. In order to achieve this, we introduce a simple model of soft vector spins that should be implementable on a variety of analog hardware platforms as well as three different dimensional annealing methods which harness the enlarged phase space of the vectorial degrees of freedom to minimize the Ising energy. We perform simulations on different benchmark problems and show that for all dimensional annealing methods we tested, vectorial degrees of freedom improve upon one-dimensional degrees of freedom when it comes to finding the ground state of the Ising model. In particular, we find that this advantage becomes most pronounced for $d \gtrsim 3$ dimensional degrees of freedom, with diminishing returns as the dimension is increased further. Our results could inspire new analog optimization hardware and algorithms that explicitly incorporate the advantage of vectorial degrees of freedom.

arXiv:2604.01003•Apr 1, 2026•2 citations

Effectiveness of quantum annealing for continuous-variable optimization

Shunta Arai, Hiroki Oshiyama, Hidetoshi Nishimori

The application of quantum annealing to the optimization of continuous-variable functions is a relatively unexplored area of research. We test the performance of quantum annealing applied to a one-dimensional continuous-variable function with a rugged energy landscape. After domain-wall encoding to map a continuous variable to discrete Ising variables, we first benchmark the performance of the real hardware, the D-Wave 2000Q, against several state-of-the-art classical optimization algorithms designed for continuous-variable problems to find that the D-Wave 2000Q matches the classical algorithms in a limited domain of computation time. Beyond this domain, classical global optimization algorithms outperform the quantum device. Next we examine several optimization algorithms that are applicable to the Ising formulation of the problem, such as the time-evolving block decimation (TEBD) to simulate ideal coherent quantum annealing, simulated annealing, simulated quantum annealing, and spin-vector Monte Carlo. The data show that TEBD's coherent quantum annealing achieves far better results than the other approaches, demonstrating the effectiveness of coherent tunneling. From these two types of benchmarks, we conclude that the hardware realization of quantum annealing has the potential to significantly outperform the best classical algorithms if thermal noise and other imperfections are sufficiently suppressed and the device operates coherently, as demonstrated in recent short-time quantum simulations.

arXiv:2305.06631•Physical Review A•Oct 2, 2023•20 citations

Quantum-Enhanced Differential Equation Solvers

Jincheng Zhang

Quantum-enhanced differential equation solvers represent a significant advancement in computational mathematics, offering the potential to accelerate the solution of complex mathematical models. This paper explores the feasibility of utilizing quantum algorithms, specifically quantum annealing and variational quantum eigensolver (VQE), to address computationally intensive differential equation problems. We detail the core mechanism of this approach, outlining the challenges and benefits of employing quantum computation for this domain. The paper concludes by highlighting the potential impact of this research on various fields, particularly those dealing with complex systems and high-dimensional mathematical models.

•Sep 4, 2026•0 citations

Quantum Annealing Algorithm Optimization and Application

Jincheng Zhang

Quantum annealing (QA) is a promising quantum computing paradigm for solving optimization problems. However, the performance of QA is often limited by issues such as slow convergence rates and sensitivity to parameter settings. This paper presents a novel optimization method designed to address these limitations. The approach introduces refined parameters and an adaptive strategy to enhance the algorithm's convergence speed and solution accuracy. We explore the application of this optimized QA method to complex problems, demonstrating its potential for improved performance. The core of the optimization lies in modifying the annealing schedule and incorporating a dynamic adjustment of the magnetic field strength, denoted as $H(t)$, where $t$ represents time. The objective function to be minimized is typically represented as $E[s]$, where $s$ is the state vector of the quantum annealer. We introduce a variance reduction technique, denoted as $\sigma(t)$, which is dynamically adjusted based on the error estimates of the current state. The overall optimization process can be summarized as: $\min_{s} E[s] \quad \text{subject to} \quad \frac{dS}{dt} = - \beta(t) E[s] - \gamma(t) H(t)s$ where $\beta(t)$ is the annealing rate and $\gamma(t)$ is the magnetic field strength. The adaptive strategy involves updating $\beta(t)$ and $\gamma(t)$ based on the error in the current solution, aiming to reduce the variance $\sigma(t)$ and improve the convergence. The theoretical analysis suggests that this approach can significantly reduce the computational cost and improve the solution quality compared to traditional QA methods. Furthermore, we investigate the impact of different parameter settings on the algorithm's performance, highlighting the importance of careful tuning for optimal results. The results demonstrate a notable improvement in solution quality and convergence speed across various benchmark problems.

•Sep 3, 2026•0 citations
. We present the complex vector gain-based annealer (CVGA), an analog computing platform designed to overcome energy barriers in X Y Hamiltonians through a higher-dimensional representation. Traditional gain-based solvers using optical or photonic hardware typically represent each X Y spin with a single complex field. These solvers often struggle with large energy barriers in complex landscapes, leading to relaxation into excited states. CVGA addresses these limitations by using two complex fields to represent each X Y spin and dynamically evolving the energy landscape through time-dependent annealing. Operating in a higher-dimensional space, CVGA bridges energy barriers in this expanded space during the continuous phase evolution, thus avoiding entrapment in local minima. We introduce several graph structures that pose challenges for X Y minimization and use them to benchmark CVGA against single-dimension X Y solvers, highlighting the benefits of higher-dimensional operation.
Abstract Complex optimization problems can be solved via dedicated machines which encode the problem in the couplings of spin Hamiltonians. However, traditional physical minimizers often select excited states due to limitations in spin dynamics. We introduce the Vector Ising Spin Annealer (VISA), a framework in gain-based computing that leverages light-matter interactions. We show that VISA overcomes the limitations by enabling spins to operate within a three-dimensional space, thereby providing a robust solution for effectively minimizing Ising Hamiltonians. Our comparative analysis demonstrates VISA’s superior performance relative to conventional single-dimension spin optimizers, highlighting its capacity to surmount significant energy barriers in intricate landscapes. Detailed studies on cyclic and random graphs reveal VISA’s proficiency in dynamically evolving the energy landscape through time-dependent gain and penalty annealing, underscoring its potential in advancing the field of complex problem-solving in physics-inspired and physics-based computing.
We investigate the minimization of Ising Hamiltonians, comparing the performance of gain-based computing paradigms based on the dynamics of semiclassical soft-spin models with quantum annealing. We systematically analyze how the energy landscape for the circulant couplings of a Möbius graph evolves with increased annealing parameters. Our findings indicate that these semiclassical models face challenges due to a widening dimensionality landscape. To counteract this issue, we introduce the manifold reduction method, which restricts the soft-spin amplitudes to a defined phase space region. Concurrently, quantum annealing demonstrates a natural capability to navigate the Ising Hamiltonian's energy landscape due to its operation within the comprehensive Hilbert space. Our study indicates that physics-inspired or physics-enhanced optimizers will likely benefit from combining classical and quantum annealing techniques.
Recently, purpose-built analog hardware that can efficiently minimize the Ising energy and thereby solve a variety of combinatorial optimization problems has been receiving widespread attention. In this work, we show how multidimensional, vectorial degrees of freedom, that are either naturally present or can be artificially created in such hardware, could strengthen the capability to find optimal solutions to optimization problems. In order to achieve this, we introduce a simple model of soft vector spins that should be implementable on a variety of analog hardware platforms as well as three different dimensional annealing methods which harness the enlarged phase space of the vectorial degrees of freedom to minimize the Ising energy. We perform simulations on different benchmark problems and show that for all dimensional annealing methods we tested, vectorial degrees of freedom improve upon one-dimensional degrees of freedom when it comes to finding the ground state of the Ising model. In particular, we find that this advantage becomes most pronounced for d≳3d \gtrsim 3d≳3 dimensional degrees of freedom, with diminishing returns as the dimension is increased further. Our results could inspire new analog optimization hardware and algorithms that explicitly incorporate the advantage of vectorial degrees of freedom.
The application of quantum annealing to the optimization of continuous-variable functions is a relatively unexplored area of research. We test the performance of quantum annealing applied to a one-dimensional continuous-variable function with a rugged energy landscape. After domain-wall encoding to map a continuous variable to discrete Ising variables, we first benchmark the performance of the real hardware, the D-Wave 2000Q, against several state-of-the-art classical optimization algorithms designed for continuous-variable problems to find that the D-Wave 2000Q matches the classical algorithms in a limited domain of computation time. Beyond this domain, classical global optimization algorithms outperform the quantum device. Next we examine several optimization algorithms that are applicable to the Ising formulation of the problem, such as the time-evolving block decimation (TEBD) to simulate ideal coherent quantum annealing, simulated annealing, simulated quantum annealing, and spin-vector Monte Carlo. The data show that TEBD's coherent quantum annealing achieves far better results than the other approaches, demonstrating the effectiveness of coherent tunneling. From these two types of benchmarks, we conclude that the hardware realization of quantum annealing has the potential to significantly outperform the best classical algorithms if thermal noise and other imperfections are sufficiently suppressed and the device operates coherently, as demonstrated in recent short-time quantum simulations.
Quantum-enhanced differential equation solvers represent a significant advancement in computational mathematics, offering the potential to accelerate the solution of complex mathematical models. This paper explores the feasibility of utilizing quantum algorithms, specifically quantum annealing and variational quantum eigensolver (VQE), to address computationally intensive differential equation problems. We detail the core mechanism of this approach, outlining the challenges and benefits of employing quantum computation for this domain. The paper concludes by highlighting the potential impact of this research on various fields, particularly those dealing with complex systems and high-dimensional mathematical models.
Quantum annealing (QA) is a promising quantum computing paradigm for solving optimization problems. However, the performance of QA is often limited by issues such as slow convergence rates and sensitivity to parameter settings. This paper presents a novel optimization method designed to address these limitations. The approach introduces refined parameters and an adaptive strategy to enhance the algorithm's convergence speed and solution accuracy. We explore the application of this optimized QA method to complex problems, demonstrating its potential for improved performance. The core of the optimization lies in modifying the annealing schedule and incorporating a dynamic adjustment of the magnetic field strength, denoted as H(t)H(t)H(t), where ttt represents time. The objective function to be minimized is typically represented as E[s]E[s]E[s], where sss is the state vector of the quantum annealer. We introduce a variance reduction technique, denoted as σ(t)\sigma(t)σ(t), which is dynamically adjusted based on the error estimates of the current state. The overall optimization process can be summarized as: min⁡sE[s]subject todSdt=−β(t)E[s]−γ(t)H(t)s\min_{s} E[s] \quad \text{subject to} \quad \frac{dS}{dt} = - \beta(t) E[s] - \gamma(t) H(t)smins​E[s]subject todtdS​=−β(t)E[s]−γ(t)H(t)s where β(t)\beta(t)β(t) is the annealing rate and γ(t)\gamma(t)γ(t) is the magnetic field strength. The adaptive strategy involves updating β(t)\beta(t)β(t) and γ(t)\gamma(t)γ(t) based on the error in the current solution, aiming to reduce the variance σ(t)\sigma(t)σ(t) and improve the convergence. The theoretical analysis suggests that this approach can significantly reduce the computational cost and improve the solution quality compared to traditional QA methods. Furthermore, we investigate the impact of different parameter settings on the algorithm's performance, highlighting the importance of careful tuning for optimal results. The results demonstrate a notable improvement in solution quality and convergence speed across various benchmark problems.