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

Physical Review A

Quantum adiabatic computation and adiabatic conditions

Zhaohui Wei, Mingsheng Ying

Published Aug 22, 2007• 31 citations
Publisher

Abstract

Recently, quantum adiabatic computation has attracted more and more attention in the literature. It is a novel quantum computation model based on adiabatic approximation, and the analysis of a quantum adiabatic algorithm depends highly on the adiabatic conditions. However, it has been pointed out that the traditional adiabatic conditions are problematic. Thus, results obtained previously should be checked and sufficient adiabatic conditions applicable to adiabatic computation should be proposed. Based on a result of Tong et al. [Phys. Rev. Lett. 98, 150402 (2007)], we propose a modified adiabatic criterion which is more applicable to the analysis of adiabatic algorithms. As an example, we prove the validity of the local adiabatic search algorithm by employing our criterion.

DOI
10.1103/physreva.76.024304

Related papers

Experimental Study of the Validity of Quantitative Conditions in the Quantum Adiabatic Theorem

Jiangfeng Du, Ling-Zhi Hu, Ya Wang +3 more

The quantum adiabatic theorem plays an important role in quantum mechanics. However, counter-examples were produced recently, indicating that their transition probabilities do not converge as predicted by the adiabatic theorem [K. P. Marzlin et al., Phys. Rev. Lett. 93, 160408 (2004); D. M. Tong et al., Phys. Rev. Lett. 95, 110407 (2005)]. For a special class of Hamiltonians, we examine the standard criterion for adiabatic evolution experimentally and theoretically, as well as three newly suggested adiabatic conditions. We show that the standard criterion is neither sufficient nor necessary.

Physical Review Letters•Aug 7, 2008•73 citations

Sufficient Condition for Validity of Quantum Adiabatic Theorem

Yong Tao

In this paper, we attempt to give a sufficient condition of guaranteeing the validity of the proof of the quantum adiabatic theorem. The new sufficient condition can clearly remove the inconsistency and the counterexample of the quantum adiabatic theorem pointed out by Marzlin and Sanders [Phys. Rev. Lett. 93 (2004) 160408].

arXiv:1010.1326•Communications in Theoretical Physics•Mar 1, 2012•4 citations

Sufficiency Criterion for the Validity of the Adiabatic Approximation

D. M. Tong, Kuldip Singh, L. C. Kwek +1 more

We examine the quantitative condition which has been widely used as a criterion for the adiabatic approximation but was recently found insufficient. Our results indicate that the usual quantitative condition is sufficient for a special class of quantum mechanical systems. For general systems, it may not be sufficient, but it, along with additional conditions, is sufficient. The usual quantitative condition and the additional conditions constitute a general criterion for the validity of the adiabatic approximation, which is applicable to all N-dimensional quantum systems. Moreover, we illustrate the use of the general quantitative criterion in some physical models.

arXiv:0704.1184•Physical Review Letters•Apr 9, 2007•122 citations

Reexamination of the quantum adiabatic theorem

Yan Zhao

The quantum adiabatic theorem is a widely applied result in quantum mechanics. However, recently, counterexamples were produced, indicating that the transition probabilities in some systems do not converge as predicted by the adiabatic theorem [K. P. Marzlin and B. C. Sanders, Phys. Rev. Lett. 93, 160408 (2004)]. In this paper, we examine a proof of the adiabatic theorem, paying specific attention to the validity of the assumptions made in the proof. We show that the convergence of the transition probabilities is path dependent when the change in the Hamiltonian is large. Finally, we consider the application of this reformulated form of the adiabatic theorem to the adiabatic evolution paradigm in quantum computation.

Physical Review A•Mar 21, 2008•23 citations

A quantum partial adiabatic evolution and its application to quantum search problem

Jie Sun, Hui Zheng, Songfeng Lu

This paper presents a framework for quantum partial adiabatic evolution and applies it to re-examine the well-known quantum search problem. We particularly focus on a detailed analysis of the algorithm’s success probability, which serves as a clear criterion for differentiating valid implementations from invalid ones. Specifically, when the time complexity aligns with the optimal quantum computation, the algorithm achieves a substantially high success probability. Conversely, so-called “improved” versions that exceed the quadratic speedup characteristic of quantum computing exhibit a negligibly low success probability with the increase of target elements. These findings underscore the critical importance of selecting the appropriate evolution interval and the correct method for calculating the success probability in studies of quantum partial adiabatic evolution.

Frontiers in Physics•Jan 8, 2026•2 citations

Optimality of Quantum Adiabatic Search Algorithm and Its Circuit Model

Jie Sun, Zhimin Zhang, Songfeng Lu

In this paper, we study two aspects of quantum adiabatic evolution for a prototypical search problem: the optimality of the corresponding algorithm and its relation to the quantum circuit model. Firstly, we propose a general framework for proving the square-root speedup of the quantum adiabatic algorithm to be optimal over classical computation, which is readily applicable to the case of multiple targets. Through this framework, we also find that it is possible to further reduce the time complexity by increasing the physical energy of the system, encompassing results from previous works. Secondly, we find that, on the one hand, when the quantum adiabatic algorithm that achieves quadratic speedup is implemented on a quantum circuit, the time slice needed is always consistent with its time complexity, which also encompasses previous results; on the other hand, however, if a further algorithmic improvement is considered, the time slice always remains invariant. This phenomenon represents a significant observation with potential applications. We anticipate that the main results of this paper will interest the quantum adiabatic computation community and may help us to design efficient quantum algorithms for practical problems in the future.

Quantum Reports•Mar 26, 2026•2 citations
Recently, quantum adiabatic computation has attracted more and more attention in the literature. It is a novel quantum computation model based on adiabatic approximation, and the analysis of a quantum adiabatic algorithm depends highly on the adiabatic conditions. However, it has been pointed out that the traditional adiabatic conditions are problematic. Thus, results obtained previously should be checked and sufficient adiabatic conditions applicable to adiabatic computation should be proposed. Based on a result of Tong et al. [Phys. Rev. Lett. 98, 150402 (2007)], we propose a modified adiabatic criterion which is more applicable to the analysis of adiabatic algorithms. As an example, we prove the validity of the local adiabatic search algorithm by employing our criterion.
The quantum adiabatic theorem plays an important role in quantum mechanics. However, counter-examples were produced recently, indicating that their transition probabilities do not converge as predicted by the adiabatic theorem [K. P. Marzlin et al., Phys. Rev. Lett. 93, 160408 (2004); D. M. Tong et al., Phys. Rev. Lett. 95, 110407 (2005)]. For a special class of Hamiltonians, we examine the standard criterion for adiabatic evolution experimentally and theoretically, as well as three newly suggested adiabatic conditions. We show that the standard criterion is neither sufficient nor necessary.
We examine the quantitative condition which has been widely used as a criterion for the adiabatic approximation but was recently found insufficient. Our results indicate that the usual quantitative condition is sufficient for a special class of quantum mechanical systems. For general systems, it may not be sufficient, but it, along with additional conditions, is sufficient. The usual quantitative condition and the additional conditions constitute a general criterion for the validity of the adiabatic approximation, which is applicable to all N-dimensional quantum systems. Moreover, we illustrate the use of the general quantitative criterion in some physical models.
The quantum adiabatic theorem is a widely applied result in quantum mechanics. However, recently, counterexamples were produced, indicating that the transition probabilities in some systems do not converge as predicted by the adiabatic theorem [K. P. Marzlin and B. C. Sanders, Phys. Rev. Lett. 93, 160408 (2004)]. In this paper, we examine a proof of the adiabatic theorem, paying specific attention to the validity of the assumptions made in the proof. We show that the convergence of the transition probabilities is path dependent when the change in the Hamiltonian is large. Finally, we consider the application of this reformulated form of the adiabatic theorem to the adiabatic evolution paradigm in quantum computation.
This paper presents a framework for quantum partial adiabatic evolution and applies it to re-examine the well-known quantum search problem. We particularly focus on a detailed analysis of the algorithm’s success probability, which serves as a clear criterion for differentiating valid implementations from invalid ones. Specifically, when the time complexity aligns with the optimal quantum computation, the algorithm achieves a substantially high success probability. Conversely, so-called “improved” versions that exceed the quadratic speedup characteristic of quantum computing exhibit a negligibly low success probability with the increase of target elements. These findings underscore the critical importance of selecting the appropriate evolution interval and the correct method for calculating the success probability in studies of quantum partial adiabatic evolution.
In this paper, we study two aspects of quantum adiabatic evolution for a prototypical search problem: the optimality of the corresponding algorithm and its relation to the quantum circuit model. Firstly, we propose a general framework for proving the square-root speedup of the quantum adiabatic algorithm to be optimal over classical computation, which is readily applicable to the case of multiple targets. Through this framework, we also find that it is possible to further reduce the time complexity by increasing the physical energy of the system, encompassing results from previous works. Secondly, we find that, on the one hand, when the quantum adiabatic algorithm that achieves quadratic speedup is implemented on a quantum circuit, the time slice needed is always consistent with its time complexity, which also encompasses previous results; on the other hand, however, if a further algorithmic improvement is considered, the time slice always remains invariant. This phenomenon represents a significant observation with potential applications. We anticipate that the main results of this paper will interest the quantum adiabatic computation community and may help us to design efficient quantum algorithms for practical problems in the future.