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

Journal of Statistical Mechanics Theory and Experiment

Phase transitions in quantum annealing of an NP-hard problem detected by fidelity susceptibility

Jun Takahashi, Koji Hukushima

Published Apr 1, 2019• 4 citations
Publisher

Abstract

Abstract Quantum annealing (QA) for the NP-hard maximum independent set problem with a unique solution is studied using the quantum Monte Carlo method. A fraction of the samples exhibit first-order phase transitions in terms of the spin-glass order parameter q . Moreover, while no singularities could be observed for the sample-averaged , a divergence in the sample-averaged fidelity susceptibility is found. Since all of the first-order transitions of q occur with smaller transverse field strength compared to the divergence point of , it is likely that the phase detected by induces the first-order transitions. This suggests that failures of QA due to exponentially small energy gaps are phenomena within this underlying phase.

DOI
10.1088/1742-5468/ab0819

Related papers

A Fidelity Susceptibility Approach to Quantum Annealing of NP-hard problems

Jun Takahashi, Koji Hukushima

The computational complexity conjecture of NP $\nsubseteq$ BQP implies that there should be an exponentially small energy gap for Quantum Annealing (QA) of NP-hard problems. We aim to verify how this computation originated gapless point could be understood based on physics, using the quantum Monte Carlo method. As a result, we found a phase transition detectable only by the divergence of fidelity susceptibility. The exponentially small gapless points of each instance are all located in the phase found in this study, which suggests that this phase transition is the physical cause of the failure of QA for NP-hard problems.

arXiv:1612.08554•Dec 27, 2016•1 citation

Computational Bottlenecks of Quantum Annealing

Sergey Knysh

A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric superposition of all possible assignments of $N$ qubits --- is closely tracked as it becomes more and more localised near the global minimum of the classical energy. Regions where the energy gap to excited states is small (e.g. at the phase transition) are the algorithm's bottlenecks. Here I show how for large problems the complexity becomes dominated by $O(\log N)$ bottlenecks inside the spin glass phase, where the gap scales as a stretched exponential. For smaller $N$, only the gap at the critical point is relevant, where it scales polynomially, as long as the phase transition is second order. This phenomenon is demonstrated rigorously for the two-pattern Gaussian Hopfield Model. Qualitative comparison with the Sherrington-Kirkpatrick Model leads to similar conclusions.

arXiv:1506.08608•Jun 29, 2015•3 citations

Zero-temperature quantum annealing bottlenecks in the spin-glass phase

Sergey Knysh

A promising approach to solving hard binary optimization problems is quantum adiabatic annealing in a transverse magnetic field. An instantaneous ground state-initially a symmetric superposition of all possible assignments of N qubits-is closely tracked as it becomes more and more localized near the global minimum of the classical energy. Regions where the energy gap to excited states is small (for instance at the phase transition) are the algorithm's bottlenecks. Here I show how for large problems the complexity becomes dominated by O(log N) bottlenecks inside the spin-glass phase, where the gap scales as a stretched exponential. For smaller N, only the gap at the critical point is relevant, where it scales polynomially, as long as the phase transition is second order. This phenomenon is demonstrated rigorously for the two-pattern Gaussian Hopfield model. Qualitative comparison with the Sherrington-Kirkpatrick model leads to similar conclusions.

Nature Communications•Aug 5, 2016•79 citations

The quantum transition of the two-dimensional Ising spin glass

Massimo Bernaschi, I. González-Adalid Pemartín, Víctor Martín-Mayor +1 more

Abstract Quantum annealers are commercial devices that aim to solve very hard computational problems1, typically those involving spin glasses2,3. Just as in metallurgic annealing, in which a ferrous metal is slowly cooled4, quantum annealers seek good solutions by slowly removing the transverse magnetic field at the lowest possible temperature. Removing the field diminishes the quantum fluctuations but forces the system to traverse the critical point that separates the disordered phase (at large fields) from the spin-glass phase (at small fields). A full understanding of this phase transition is still missing. A debated, crucial question regards the closing of the energy gap separating the ground state from the first excited state. All hopes of achieving an exponential speed-up, compared to classical computers, rest on the assumption that the gap will close algebraically with the number of spins5–9. However, renormalization group calculations predict instead that there is an infinite-randomness fixed point10. Here we solve this debate through extreme-scale numerical simulations, finding that both parties have grasped parts of the truth. Although the closing of the gap at the critical point is indeed super-algebraic, it remains algebraic if one restricts the symmetry of possible excitations. As this symmetry restriction is experimentally achievable (at least nominally), there is still hope for the quantum annealing paradigm11–13.

arXiv:2310.07486•Nature•Jul 10, 2024•35 citations

Proof of Avoidability of the Quantum First-Order Transition in Transverse Magnetization in Quantum Annealing of Finite-Dimensional Spin Glasses

Mizuki Yamaguchi, Naoto Shiraishi, Koji Hukushima

Abstract It is rigorously shown that an appropriate quantum annealing for any finite-dimensional spin system has no quantum first-order transition in transverse magnetization. This result can be applied to finite-dimensional spin-glass systems, where the ground state search problem is known to be hard to solve. Consequently, it is strongly suggested that the quantum first-order transition in transverse magnetization is not fatal to the difficulty of combinatorial optimization problems in quantum annealing.

arXiv:2307.00791•Journal of Statistical Physics•Jan 28, 2024•0 citations

Anomalously slow dynamics of inhomogeneous quantum annealing

Mohammadhossein Dadgar, Christopher L. Baldwin

Inhomogeneous quantum annealing (IQA), in which transverse fields are turned off one by one rather than simultaneously, has been proposed as an effective way to avoid the first-order phase transitions that impede conventional quantum annealing (QA). Here we explicitly study the dynamics of IQA, rather than merely the thermodynamics, and find that it is appreciably slower than the phase diagram would suggest. Interestingly, this slowdown manifests both when IQA succeeds in circumventing phase transitions and when it fails. Even in the absence of transitions, such as for the mean-field models that have been analyzed previously, IQA is slower than expected by a factor of the number of spins $N$. More significantly, we show that in non-mean-field models, first-order transitions are likely to be quite common, and the gap at such transitions is not merely exponential in $N$ but exactly zero. Thus IQA cannot reach the ground state on any timescale. Both of these results can be understood through the simple observation that a spin's magnetization becomes conserved once its field is turned off during the IQA protocol.

arXiv:2502.03535•Physical Review A•Jun 2, 2025•1 citation
Abstract Quantum annealing (QA) for the NP-hard maximum independent set problem with a unique solution is studied using the quantum Monte Carlo method. A fraction of the samples exhibit first-order phase transitions in terms of the spin-glass order parameter q . Moreover, while no singularities could be observed for the sample-averaged , a divergence in the sample-averaged fidelity susceptibility is found. Since all of the first-order transitions of q occur with smaller transverse field strength compared to the divergence point of , it is likely that the phase detected by induces the first-order transitions. This suggests that failures of QA due to exponentially small energy gaps are phenomena within this underlying phase.
The computational complexity conjecture of NP ⊈\nsubseteq⊈ BQP implies that there should be an exponentially small energy gap for Quantum Annealing (QA) of NP-hard problems. We aim to verify how this computation originated gapless point could be understood based on physics, using the quantum Monte Carlo method. As a result, we found a phase transition detectable only by the divergence of fidelity susceptibility. The exponentially small gapless points of each instance are all located in the phase found in this study, which suggests that this phase transition is the physical cause of the failure of QA for NP-hard problems.
A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric superposition of all possible assignments of NNN qubits --- is closely tracked as it becomes more and more localised near the global minimum of the classical energy. Regions where the energy gap to excited states is small (e.g. at the phase transition) are the algorithm's bottlenecks. Here I show how for large problems the complexity becomes dominated by O(log⁡N)O(\log N)O(logN) bottlenecks inside the spin glass phase, where the gap scales as a stretched exponential. For smaller NNN, only the gap at the critical point is relevant, where it scales polynomially, as long as the phase transition is second order. This phenomenon is demonstrated rigorously for the two-pattern Gaussian Hopfield Model. Qualitative comparison with the Sherrington-Kirkpatrick Model leads to similar conclusions.
A promising approach to solving hard binary optimization problems is quantum adiabatic annealing in a transverse magnetic field. An instantaneous ground state-initially a symmetric superposition of all possible assignments of N qubits-is closely tracked as it becomes more and more localized near the global minimum of the classical energy. Regions where the energy gap to excited states is small (for instance at the phase transition) are the algorithm's bottlenecks. Here I show how for large problems the complexity becomes dominated by O(log N) bottlenecks inside the spin-glass phase, where the gap scales as a stretched exponential. For smaller N, only the gap at the critical point is relevant, where it scales polynomially, as long as the phase transition is second order. This phenomenon is demonstrated rigorously for the two-pattern Gaussian Hopfield model. Qualitative comparison with the Sherrington-Kirkpatrick model leads to similar conclusions.
Abstract Quantum annealers are commercial devices that aim to solve very hard computational problems1, typically those involving spin glasses2,3. Just as in metallurgic annealing, in which a ferrous metal is slowly cooled4, quantum annealers seek good solutions by slowly removing the transverse magnetic field at the lowest possible temperature. Removing the field diminishes the quantum fluctuations but forces the system to traverse the critical point that separates the disordered phase (at large fields) from the spin-glass phase (at small fields). A full understanding of this phase transition is still missing. A debated, crucial question regards the closing of the energy gap separating the ground state from the first excited state. All hopes of achieving an exponential speed-up, compared to classical computers, rest on the assumption that the gap will close algebraically with the number of spins5–9. However, renormalization group calculations predict instead that there is an infinite-randomness fixed point10. Here we solve this debate through extreme-scale numerical simulations, finding that both parties have grasped parts of the truth. Although the closing of the gap at the critical point is indeed super-algebraic, it remains algebraic if one restricts the symmetry of possible excitations. As this symmetry restriction is experimentally achievable (at least nominally), there is still hope for the quantum annealing paradigm11–13.
Abstract It is rigorously shown that an appropriate quantum annealing for any finite-dimensional spin system has no quantum first-order transition in transverse magnetization. This result can be applied to finite-dimensional spin-glass systems, where the ground state search problem is known to be hard to solve. Consequently, it is strongly suggested that the quantum first-order transition in transverse magnetization is not fatal to the difficulty of combinatorial optimization problems in quantum annealing.
Inhomogeneous quantum annealing (IQA), in which transverse fields are turned off one by one rather than simultaneously, has been proposed as an effective way to avoid the first-order phase transitions that impede conventional quantum annealing (QA). Here we explicitly study the dynamics of IQA, rather than merely the thermodynamics, and find that it is appreciably slower than the phase diagram would suggest. Interestingly, this slowdown manifests both when IQA succeeds in circumventing phase transitions and when it fails. Even in the absence of transitions, such as for the mean-field models that have been analyzed previously, IQA is slower than expected by a factor of the number of spins NNN. More significantly, we show that in non-mean-field models, first-order transitions are likely to be quite common, and the gap at such transitions is not merely exponential in NNN but exactly zero. Thus IQA cannot reach the ground state on any timescale. Both of these results can be understood through the simple observation that a spin's magnetization becomes conserved once its field is turned off during the IQA protocol.