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:2610.30301

Non-adiabatic Optimisation via Localisation-Delocalisation Transitions

Ryan Smith, Sabrina Yue Wang, Filippo Maria Gambetta, Raul A. Santos

cond-mat.dis-nncond-mat.stat-mechquant-phSubmitted Oct 21, 2026• Announced Oct 23, 2026• 0 citations
arXivHTMLPDF

Abstract

The promise of efficiently solving classical optimisation problems on quantum computers is tantalizing. As many such problems can be mapped to approximating the ground state of spin-glasses, paradigmatic models for studying many-body localisation, it is natural to ask if some of the intuition coming from quantum statistical mechanics can help guide the construction of novel quantum optimisation algorithms. In this work, we discuss how continuous reverse quantum annealing crossing a many-body localisation transition can be accelerated by considering the density of Landau-Zener crossings as the system is quenched. We provide an interpretation of this behaviour in terms of an effective Fokker-Planck equation for the success probability of the algorithm. This interpretation suggests an improvement in the required annealing time as a function of the system size $N$, which goes from $\mathcal{O}({\rm poly}(N))$ to $\mathcal{O}(1)$ for reference states with non-vanishing energy density. We show that the continuous dynamics can be Trotterised with a number of steps that remains modest as system size increases, making it appealing for near-term devices. For the resulting circuit implementation, we provide a quantitative strategy for determining the parameters of the time-dependent Hamiltonian. We compare the performance of our digitised algorithm, which we call FRIO, against that of the QAOA for finding the ground state of spin-glass problems, in particular the SK model. The numerical results suggest that with suitably selected circuit parameters which can be efficiently found using thermalizing dynamics, FRIO almost always outperforms the conventional QAOA ansatz with pre-optimized angles.

AI Summary

Can reverse quantum annealing exploit localisation–delocalisation transitions to improve classical spin-glass optimisation without adiabatic evolution? This paper introduces Fast Reverse Iterative Optimisation (FRIO), which starts from a classical reference bitstring, applies reference-aligned longitudinal and transverse fields, then quenches both fields off. Computational-basis measurements replace the reference only when they lower its energy. The protocol is also digitised using first- and second-order Trotter decompositions. A coarse-grained model treats avoided crossings as independent Landau–Zener events and derives an effective Fokker–Planck description. Assuming exponentially many available crossings, polynomially scaling gaps and a favourable downward-transition asymmetry, it predicts that an $\mathcal{O}(1)$ annealing time per cycle can yield an energy-improvement probability above $1/2$. This is not a bound on total ground-state-finding time. A parameter-selection procedure uses short-time thermalisation of a four-qubit marginal’s inverse participation ratio. Exact-diagonalisation and circuit simulations study SK instances and weighted degree-$3,4,5$ regular graphs, with optimisation benchmarks reaching $N=18$. At $B_z=1$ and $B_x/B_z\approx1$, digitised FRIO generally produces more ground-state samples than QAOA with ensemble-based or instance-optimised angles, using comparable circuit resources and equal measurement budgets. Benchmarks use ten instances per size and $50{,}000$ measurements per method. The stated limitations include unverified large-system parameter transfer, declining improvement probabilities near the spectrum bottom, and assumptions of independent crossings and slowly varying drift and diffusion. One-step Trotterisation deteriorates at larger simulated sizes; larger systems may require longer quenches and more Trotter steps.

Little sign of AI-generated textAI use disclosedSmall numerics onlyStrong assumptionsMissing comparisonPossible error
\Cref{subsec:nonadiabatic} was partially developed through discussions with Claude. Claude was also used to identify typographical errors throughout the manuscript.

Central claim may not hold: Non-vanishing reference energy density does not establish the positive, suitably size-dependent asymmetry eta required by the paper's constant-time success argument. The conditional stochastic analysis is not validated in the main numerical operating regime, and simulations of at most 18 spins do not establish the advertised asymptotic annealing-time improvement. The exponential crossing rate, polynomial gaps and independent constant-coefficient jump model predict exponentially growing fixed-time energy variance, contradicting the polynomial bandwidth of the final SK Hamiltonian and invalidating the central asymptotic extrapolation. The displayed Gaussian integrates below the reference energy to one-half erfc(x), not one-half erfc(-x), and the assigned drift sign is opposite to the stated downward-transition bias. Step 1's claimed bias threshold is generally incorrect because the required field depends on every competitor's energy difference divided by twice its Hamming distance from the reference.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
25 pages, 5 figures + supplementary information

Related papers

Improving the efficiency of quantum annealing with controlled diagonal catalysts

T Hattori, Shu Tanaka

Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The guiding principle of quantum annealing is the adiabatic theorem in quantum mechanics, which guarantees that a system remains in the ground state of its Hamiltonian if the time evolution is sufficiently slow. According to the adiabatic theorem, the annealing time required for quantum annealing to satisfy the adiabaticity scales inversely proportional to the square of the minimum energy gap between the ground state and the first excited state during time evolution. As a result, finding the ground state becomes significantly more difficult when the energy gap is small, creating a major bottleneck in quantum annealing. Expanding the energy gap is one strategy for improving the performance of quantum annealing; however, its implementation in actual hardware remains difficult. This study proposes a method for efficiently solving instances with small energy gaps by introducing additional local terms to the Hamiltonian and exploiting the diabatic transition remaining in the small energy gap. The proposed method achieves an approximate quadratic speedup of the exponential scaling exponent in time to solution compared to the conventional quantum annealing. In addition, we investigate the transferability of the parameters obtained with the proposed method.

arXiv:2503.15244•Physical Review A•Feb 3, 2026•4 citations

Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics

Steven Abel, Andrei Constantin, Luca A. Nutricati

Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.

quant-pharXiv:2605.06857•Contemporary Physics•May 11, 2026•1 citation

Reaching states below the threshold energy in spin glasses via quantum annealing

Christopher L. Baldwin

Although quantum annealing is usually considered as a method for locating the ground states of difficult spin-glass and optimization problems, its use in approximate optimization -- finding low- but not zero-energy states in a reasonably short amount of time -- is no less important. Here we investigate the behavior of quantum annealing at approximate optimization in the canonical mean-field spin-glass models, the spherical $p$-spin models, and find that it performs surprisingly well. Whereas it had long been assumed that infinite-range spin glasses have a unique ``threshold'' energy at which all quench and annealing dynamics become trapped until exponential timescales, recent work has shown that two-stage quenches can in fact reach states below the naive threshold in more generic situations. We demonstrate that quantum annealing is also capable of exploiting this effect to locate sub-threshold states in $O(1)$ time. Not only can it attain energies as far below the threshold as classical annealing algorithms, but it can do so significantly faster: for an annealing schedule taking time $τ$, the residual energy under quantum annealing decays as $τ^{-α}$ with an exponent up to twice as large as that of simulated annealing in the cases considered. Importantly, by deriving and numerically solving closed integro-differential equations that hold in the thermodynamic limit, our results are free from finite-size effects and hold for annealing times that are unambiguously independent of system size.

quant-pharXiv:2603.23602•Mar 26, 2026•2 citations

Best Annealing Path of Quantum Annealing via Efficient Adiabatic Phase Transition

Kiyotaka Murashima

Quantum Annealing (QA) has already put into practical use and considered useful for solving many social issues, such as reduction of traffic congestion and delivery optimization. But in QA, when the energy difference between the ground state and the first excited state is small, the transition probability between them increases. Therefore, in order to decrease the transition, QA has to be performed at extremely low temperatures. To simulate the situation, it has the problem in that it takes much time. Many studies are underway to accelerate QA theoretically, one of which is to incorporate non-stoquastic Hamiltonian. On the other hand, I proposed Nested Simulated Annealing (NSA) inspired by Quantum Monte Carlo (QMC). I showed the computational speedup could be achieved dramatically, by considering the idea that the effect of flipping a spin preferentially influenced the spins directly interacting with it. Although NSA was based on such classical concept of causality, the hybrid computation both quantum and classical approach worked well. In this paper, in order to discuss the relationship between NSA and non-stoquastic Hamiltonian like XX-interaction, the spins are treated as continuous variables. I derive the formula to calculate the total energy in both with a problem Hamiltonian and the perturbation Hamiltonian induced by a transverse electromagnetic field. And I will show a clear relationship between local-maxima and the convergence speed when calculating it with the binary spin. More precisely, the annealing path with the smallest local-maxima converges fast, even though it consumes fewer computational resources. Therefore, it is possible to induce an optimal adiabatic phase transition by selecting NSA parameters appropriately. This paper shows an effective method to choose the parameters when simulating QMC on a classical computer.

quant-pharXiv:2608.30282•Sep 1, 2026•0 citations

Classical and Quantum Computation in Ground States and Beyond

Elizabeth Crosson

In this dissertation we study classical and quantum spin systems with applications to the theory of computation. In particular, we examine computational aspects of these systems beyond their ground states by considering the effects of non-zero temperatures and excited energy states. In the first part we show that universal classical computations can be encoded into equilibrium thermal states of classical spin systems, at sufficiently low temperatures which are independent of the system size. In the second part we explore different strategies for optimization with the quantum adiabatic algorithm, and we show that it is possible to increase the success probability for hard random instances by following the counterintuitive strategy of evolving along the Hamiltonian path more rapidly. In the third part we examine the performance of simulated quantum annealing in finding the minimum of an energy function which contains a high energy barrier, and we provide evidence that simulated quantum annealing inherits some of the advantages of quantum annealing which allow it to pass through the high barrier and minimize the energy function efficiently. In the last part we show that the path-integral quantum Monte Carlo method leads to a provably efficient algorithm for approximating the partition function of any 1D generalized transverse Ising spin chain (with position-dependent local fields and frustrated interactions), at temperatures which are independent of the system size.

•Sep 29, 2015•1 citation

Numerical Studies of the Quantum Adiabatic Algorithm

A. P. Young, Itay Hen

Quantum annealers promise to solve practical optimization problems potentially faster than conventional classical computers. One of the major ongoing debates in this context pertains to their robustness against the decohering effects of finite temperature and interactions with the environment. We argue that even in an ideal setting of very low temperatures and in the absence of a decohering environment, quantum annealers do not necessarily perform better than classical heuristic solvers. Here, we numerically study the performance of the quantum adiabatic algorithm (QAA) on a variety of constraint satisfaction problems and a spin glass problem by studying the size dependence of the minimum energy gap during the evolution of the QAA. We do so by employing Quantum Monte Carlo schemes as these allow us to study these problems at much larger scales than exact methods would allow. We find that in all cases a quantum phase transition occurs and the minimum gap decreases exponentially with system size, leading to an exponentially large running time for the QAA. Based on these and other results, we briefly discuss potential modifications to the QAA that may improve the scaling of the minimum gap, leading to faster quantum adiabatic algorithms.

Journal of Physics Conference Series•Sep 28, 2015•0 citations
The promise of efficiently solving classical optimisation problems on quantum computers is tantalizing. As many such problems can be mapped to approximating the ground state of spin-glasses, paradigmatic models for studying many-body localisation, it is natural to ask if some of the intuition coming from quantum statistical mechanics can help guide the construction of novel quantum optimisation algorithms. In this work, we discuss how continuous reverse quantum annealing crossing a many-body localisation transition can be accelerated by considering the density of Landau-Zener crossings as the system is quenched. We provide an interpretation of this behaviour in terms of an effective Fokker-Planck equation for the success probability of the algorithm. This interpretation suggests an improvement in the required annealing time as a function of the system size NNN, which goes from O(poly(N))\mathcal{O}({\rm poly}(N))O(poly(N)) to O(1)\mathcal{O}(1)O(1) for reference states with non-vanishing energy density. We show that the continuous dynamics can be Trotterised with a number of steps that remains modest as system size increases, making it appealing for near-term devices. For the resulting circuit implementation, we provide a quantitative strategy for determining the parameters of the time-dependent Hamiltonian. We compare the performance of our digitised algorithm, which we call FRIO, against that of the QAOA for finding the ground state of spin-glass problems, in particular the SK model. The numerical results suggest that with suitably selected circuit parameters which can be efficiently found using thermalizing dynamics, FRIO almost always outperforms the conventional QAOA ansatz with pre-optimized angles.
Can reverse quantum annealing exploit localisation–delocalisation transitions to improve classical spin-glass optimisation without adiabatic evolution? This paper introduces Fast Reverse Iterative Optimisation (FRIO), which starts from a classical reference bitstring, applies reference-aligned longitudinal and transverse fields, then quenches both fields off. Computational-basis measurements replace the reference only when they lower its energy. The protocol is also digitised using first- and second-order Trotter decompositions.
A coarse-grained model treats avoided crossings as independent Landau–Zener events and derives an effective Fokker–Planck description. Assuming exponentially many available crossings, polynomially scaling gaps and a favourable downward-transition asymmetry, it predicts that an O(1)\mathcal{O}(1)O(1) annealing time per cycle can yield an energy-improvement probability above 1/21/21/2. This is not a bound on total ground-state-finding time. A parameter-selection procedure uses short-time thermalisation of a four-qubit marginal’s inverse participation ratio.
Exact-diagonalisation and circuit simulations study SK instances and weighted degree-3,4,53,4,53,4,5 regular graphs, with optimisation benchmarks reaching N=18N=18N=18. At Bz=1B_z=1Bz​=1 and Bx/Bz≈1B_x/B_z\approx1Bx​/Bz​≈1, digitised FRIO generally produces more ground-state samples than QAOA with ensemble-based or instance-optimised angles, using comparable circuit resources and equal measurement budgets. Benchmarks use ten instances per size and 50,00050{,}00050,000 measurements per method.
The stated limitations include unverified large-system parameter transfer, declining improvement probabilities near the spectrum bottom, and assumptions of independent crossings and slowly varying drift and diffusion. One-step Trotterisation deteriorates at larger simulated sizes; larger systems may require longer quenches and more Trotter steps.
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The guiding principle of quantum annealing is the adiabatic theorem in quantum mechanics, which guarantees that a system remains in the ground state of its Hamiltonian if the time evolution is sufficiently slow. According to the adiabatic theorem, the annealing time required for quantum annealing to satisfy the adiabaticity scales inversely proportional to the square of the minimum energy gap between the ground state and the first excited state during time evolution. As a result, finding the ground state becomes significantly more difficult when the energy gap is small, creating a major bottleneck in quantum annealing. Expanding the energy gap is one strategy for improving the performance of quantum annealing; however, its implementation in actual hardware remains difficult. This study proposes a method for efficiently solving instances with small energy gaps by introducing additional local terms to the Hamiltonian and exploiting the diabatic transition remaining in the small energy gap. The proposed method achieves an approximate quadratic speedup of the exponential scaling exponent in time to solution compared to the conventional quantum annealing. In addition, we investigate the transferability of the parameters obtained with the proposed method.
Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.
Although quantum annealing is usually considered as a method for locating the ground states of difficult spin-glass and optimization problems, its use in approximate optimization -- finding low- but not zero-energy states in a reasonably short amount of time -- is no less important. Here we investigate the behavior of quantum annealing at approximate optimization in the canonical mean-field spin-glass models, the spherical ppp-spin models, and find that it performs surprisingly well. Whereas it had long been assumed that infinite-range spin glasses have a unique ``threshold'' energy at which all quench and annealing dynamics become trapped until exponential timescales, recent work has shown that two-stage quenches can in fact reach states below the naive threshold in more generic situations. We demonstrate that quantum annealing is also capable of exploiting this effect to locate sub-threshold states in O(1)O(1)O(1) time. Not only can it attain energies as far below the threshold as classical annealing algorithms, but it can do so significantly faster: for an annealing schedule taking time τττ, the residual energy under quantum annealing decays as τ−ατ^{-α}τ−α with an exponent up to twice as large as that of simulated annealing in the cases considered. Importantly, by deriving and numerically solving closed integro-differential equations that hold in the thermodynamic limit, our results are free from finite-size effects and hold for annealing times that are unambiguously independent of system size.
Quantum Annealing (QA) has already put into practical use and considered useful for solving many social issues, such as reduction of traffic congestion and delivery optimization. But in QA, when the energy difference between the ground state and the first excited state is small, the transition probability between them increases. Therefore, in order to decrease the transition, QA has to be performed at extremely low temperatures. To simulate the situation, it has the problem in that it takes much time. Many studies are underway to accelerate QA theoretically, one of which is to incorporate non-stoquastic Hamiltonian. On the other hand, I proposed Nested Simulated Annealing (NSA) inspired by Quantum Monte Carlo (QMC). I showed the computational speedup could be achieved dramatically, by considering the idea that the effect of flipping a spin preferentially influenced the spins directly interacting with it. Although NSA was based on such classical concept of causality, the hybrid computation both quantum and classical approach worked well. In this paper, in order to discuss the relationship between NSA and non-stoquastic Hamiltonian like XX-interaction, the spins are treated as continuous variables. I derive the formula to calculate the total energy in both with a problem Hamiltonian and the perturbation Hamiltonian induced by a transverse electromagnetic field. And I will show a clear relationship between local-maxima and the convergence speed when calculating it with the binary spin. More precisely, the annealing path with the smallest local-maxima converges fast, even though it consumes fewer computational resources. Therefore, it is possible to induce an optimal adiabatic phase transition by selecting NSA parameters appropriately. This paper shows an effective method to choose the parameters when simulating QMC on a classical computer.
In this dissertation we study classical and quantum spin systems with applications to the theory of computation. In particular, we examine computational aspects of these systems beyond their ground states by considering the effects of non-zero temperatures and excited energy states. In the first part we show that universal classical computations can be encoded into equilibrium thermal states of classical spin systems, at sufficiently low temperatures which are independent of the system size. In the second part we explore different strategies for optimization with the quantum adiabatic algorithm, and we show that it is possible to increase the success probability for hard random instances by following the counterintuitive strategy of evolving along the Hamiltonian path more rapidly. In the third part we examine the performance of simulated quantum annealing in finding the minimum of an energy function which contains a high energy barrier, and we provide evidence that simulated quantum annealing inherits some of the advantages of quantum annealing which allow it to pass through the high barrier and minimize the energy function efficiently. In the last part we show that the path-integral quantum Monte Carlo method leads to a provably efficient algorithm for approximating the partition function of any 1D generalized transverse Ising spin chain (with position-dependent local fields and frustrated interactions), at temperatures which are independent of the system size.
Quantum annealers promise to solve practical optimization problems potentially faster than conventional classical computers. One of the major ongoing debates in this context pertains to their robustness against the decohering effects of finite temperature and interactions with the environment. We argue that even in an ideal setting of very low temperatures and in the absence of a decohering environment, quantum annealers do not necessarily perform better than classical heuristic solvers. Here, we numerically study the performance of the quantum adiabatic algorithm (QAA) on a variety of constraint satisfaction problems and a spin glass problem by studying the size dependence of the minimum energy gap during the evolution of the QAA. We do so by employing Quantum Monte Carlo schemes as these allow us to study these problems at much larger scales than exact methods would allow. We find that in all cases a quantum phase transition occurs and the minimum gap decreases exponentially with system size, leading to an exponentially large running time for the QAA. Based on these and other results, we briefly discuss potential modifications to the QAA that may improve the scaling of the minimum gap, leading to faster quantum adiabatic algorithms.