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

Analytic study of quantum annealing

悟史 森田

Published Jan 1, 2008• 1 citation
OpenAlex

Related papers

Statistical Analysis of Quantum Annealing

Yazhen Wang, Shang Wu, Hongzhi Liu

Statistica Sinica•Nov 29, 2021•0 citations

Pulsed Quantum Annealing

Vasilios D. Karanikolas, Shiro Kawabata

We propose a modified quantum annealing protocol, i. e., pulsed quantum annealing} (PQA), in order to increase the success probability by a pulse application during the quantum annealing process. It is well known that the success probability of the conventional quantum annealing is reduced due to the Landau-Zener transitions. By applying a pulse to the system, we modulate the success probability and increase it, compared to the conventional quantum annealing, by optimizing the pulse parameters. We demonstrate our findings for a single qubit both numerically and analytically. The analytical model is based on the tranfer matrix approach and it is in good agreement with the full numerical results. We also investigate the PQA protocol for multi-qubit cases $i. e.,$ random spin-glass instances, and we present an overall increase of the success probability over the conventional quantum annealing, by optimizing the pulse parameters. Our results indicate that PQA can be used to design future high-performance quantum annealing machines, especially for hard instances that the conventional QA protocol behaves poorly.

arXiv:1806.08517•Journal of the Physical Society of Japan•Aug 17, 2020•10 citations

Assessing the Quantum in Quantum Annealing

Wade DeGottardi, David Ferguson, С. А. Новиков +2 more

Bulletin of the American Physical Society•Mar 7, 2019•0 citations

Avoided level crossings with exponentially closing gaps in quantum annealing

Arthur Braida, Simon Martiel, Ioan Todinca

This paper explores the phenomenon of avoided level crossings in quantum annealing, a promising framework for quantum computing that may provide a quantum advantage for certain tasks. Quantum annealing (QA) involves letting a quantum system evolve according to the Schr\"odinger equation, with the goal of obtaining the optimal solution to an optimization problem through measurements of the final state. However, the continuous nature of quantum annealing makes analytical analysis challenging, particularly with regard to the instantaneous eigenenergies. The adiabatic theorem provides a theoretical result for the annealing time required to obtain the optimal solution with high probability, which is inversely proportional to the square of the minimum spectral gap. Avoided level crossings can create exponentially closing gaps, which can lead to exponentially long running times for optimization problems. In this paper, we use a perturbative expansion to derive a condition for the occurrence of an avoided level crossing during the annealing process. We then apply this condition to the MaxCut problem on bipartite graphs. We show that no exponentially small gaps arise for regular bipartite graphs, implying that QA can efficiently solve MaxCut in that case. On the other hand, we show that irregularities in the vertex degrees can lead to the satisfaction of the avoided level crossing occurrence condition. We provide numerical evidence to support this theoretical development, and discuss the relation between the presence of exponentially closing gaps and the failure of quantum annealing.

arXiv:2304.12872•Physical Review A•Feb 12, 2024•2 citations

Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems

Lucas T. Brady, Christopher L. Baldwin, Aniruddha Bapat +2 more

Quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear. Here we analytically apply the framework of optimal control theory to show that generically, given a fixed amount of time, the optimal procedure has the pulsed (or "bang-bang") structure of QAOA at the beginning and end but can have a smooth annealing structure in between. This is in contrast to previous works which have suggested that bang-bang (i.e., QAOA) protocols are ideal. To support this theoretical work, we carry out simulations of various transverse field Ising models, demonstrating that bang-anneal-bang protocols are more common. The general features identified here provide guideposts for the nascent experimental implementations of quantum optimization algorithms.

arXiv:2003.08952•Physical Review Letters•Feb 19, 2021•138 citations

Experiments on Quantum Annealing

G. Aeppli, T. F. Rosenbaum

Lecture notes in physics•Nov 16, 2005•2 citations
We propose a modified quantum annealing protocol, i. e., pulsed quantum annealing} (PQA), in order to increase the success probability by a pulse application during the quantum annealing process. It is well known that the success probability of the conventional quantum annealing is reduced due to the Landau-Zener transitions. By applying a pulse to the system, we modulate the success probability and increase it, compared to the conventional quantum annealing, by optimizing the pulse parameters. We demonstrate our findings for a single qubit both numerically and analytically. The analytical model is based on the tranfer matrix approach and it is in good agreement with the full numerical results. We also investigate the PQA protocol for multi-qubit cases i.e.,i. e.,i.e., random spin-glass instances, and we present an overall increase of the success probability over the conventional quantum annealing, by optimizing the pulse parameters. Our results indicate that PQA can be used to design future high-performance quantum annealing machines, especially for hard instances that the conventional QA protocol behaves poorly.
This paper explores the phenomenon of avoided level crossings in quantum annealing, a promising framework for quantum computing that may provide a quantum advantage for certain tasks. Quantum annealing (QA) involves letting a quantum system evolve according to the Schr\"odinger equation, with the goal of obtaining the optimal solution to an optimization problem through measurements of the final state. However, the continuous nature of quantum annealing makes analytical analysis challenging, particularly with regard to the instantaneous eigenenergies. The adiabatic theorem provides a theoretical result for the annealing time required to obtain the optimal solution with high probability, which is inversely proportional to the square of the minimum spectral gap. Avoided level crossings can create exponentially closing gaps, which can lead to exponentially long running times for optimization problems. In this paper, we use a perturbative expansion to derive a condition for the occurrence of an avoided level crossing during the annealing process. We then apply this condition to the MaxCut problem on bipartite graphs. We show that no exponentially small gaps arise for regular bipartite graphs, implying that QA can efficiently solve MaxCut in that case. On the other hand, we show that irregularities in the vertex degrees can lead to the satisfaction of the avoided level crossing occurrence condition. We provide numerical evidence to support this theoretical development, and discuss the relation between the presence of exponentially closing gaps and the failure of quantum annealing.
Quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear. Here we analytically apply the framework of optimal control theory to show that generically, given a fixed amount of time, the optimal procedure has the pulsed (or "bang-bang") structure of QAOA at the beginning and end but can have a smooth annealing structure in between. This is in contrast to previous works which have suggested that bang-bang (i.e., QAOA) protocols are ideal. To support this theoretical work, we carry out simulations of various transverse field Ising models, demonstrating that bang-anneal-bang protocols are more common. The general features identified here provide guideposts for the nascent experimental implementations of quantum optimization algorithms.