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:math-ph/0411083 · Communications in Mathematical Physics

Precise Coupling Terms in Adiabatic Quantum Evolution: The Generic Case

Volker Betz, Stefan Teufel

Published Aug 13, 2005• 25 citations
arXivHTMLPDF
DOI
10.1007/s00220-005-1419-1

Related papers

Precise Coupling Terms in Adiabatic Quantum Evolution

Volker Betz, Stefan Teufel

arXiv:math-ph/0404021•Annales Henri Poincaré•Apr 1, 2005•14 citations

Nonlinear Adiabatic Evolution of Quantum Systems

Jie Liu, Sheng-Chang Li, Libin Fu +1 more

Springer eBooks•Jan 1, 2018•1 citation

Adiabatic approximation, Gell-Mann and Low theorem, and degeneracies: A pedagogical example

Christian Brouder, Gabriel Stoltz, Gianluca Panati

We study a simple system described by a $2\ifmmode\times\else\texttimes\fi{}2$ Hamiltonian and the evolution of its quantum states under the influence of a perturbation. More precisely, when the initial Hamiltonian is not degenerate, we check analytically the validity of the adiabatic approximation and verify that, even if the evolution operator has no limit for adiabatic switchings, the Gell-Mann and Low formula allows the evolution of eigenstates to be followed. In the degenerate case, for generic initial eigenstates, the adiabatic approximation (obtained by two different limiting procedures) is either useless or wrong, and the Gell-Mann and Low formula does not hold. We show how to select initial states in order to avoid such failures.

arXiv:0807.4218•Physical Review A•Oct 3, 2008•17 citations

On the efficiency of Hamiltonian-based quantum computation for low-rank matrices

Zhenwei Cao, Alexander Elgart

We present an extension of adiabatic quantum computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting subroutine. Our other results include a lower bound on the amount of time needed to perform a general Hamiltonian-based quantum search, a lower bound on the evolution time needed to perform a search that is valid in the presence of control error and a generic upper bound on the minimum eigenvalue gap for evolutions. In particular, we demonstrate that quantum speedup for the unstructured search using AQC type algorithms may only be achieved under very rigid control precision requirements.

arXiv:1004.4911•Journal of Mathematical Physics•Mar 1, 2012•6 citations

Nonlinear Adiabatic Evolution of Quantum Systems

Jie Liu, Sheng-Chang Li, Libin Fu +1 more

Springer eBooks•Jan 1, 2018•11 citations

On the efficiency of Hamiltonian–based quantum computation for low–rank matrices

Zhenwei Cao, Alexander Elgart

We present an extension of Adiabatic Quantum Computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting subroutine. Our other results include a lower bound on the amount of time needed to perform a general Hamiltonian-based quantum search, a lower bound on the evolution time needed to perform a search that is valid in the presence of control error and a generic upper bound on the minimum eigenvalue gap for evolutions. In particular, we demonstrate that quantum speedup for the unstructured search using AQC type algorithms may only be achieved under very rigid control precision requirements.

•Jan 1, 2012•6 citations
We study a simple system described by a $2\ifmmode\times\else\texttimes\fi{}2$ Hamiltonian and the evolution of its quantum states under the influence of a perturbation. More precisely, when the initial Hamiltonian is not degenerate, we check analytically the validity of the adiabatic approximation and verify that, even if the evolution operator has no limit for adiabatic switchings, the Gell-Mann and Low formula allows the evolution of eigenstates to be followed. In the degenerate case, for generic initial eigenstates, the adiabatic approximation (obtained by two different limiting procedures) is either useless or wrong, and the Gell-Mann and Low formula does not hold. We show how to select initial states in order to avoid such failures.
We present an extension of adiabatic quantum computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting subroutine. Our other results include a lower bound on the amount of time needed to perform a general Hamiltonian-based quantum search, a lower bound on the evolution time needed to perform a search that is valid in the presence of control error and a generic upper bound on the minimum eigenvalue gap for evolutions. In particular, we demonstrate that quantum speedup for the unstructured search using AQC type algorithms may only be achieved under very rigid control precision requirements.
We present an extension of Adiabatic Quantum Computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting subroutine. Our other results include a lower bound on the amount of time needed to perform a general Hamiltonian-based quantum search, a lower bound on the evolution time needed to perform a search that is valid in the presence of control error and a generic upper bound on the minimum eigenvalue gap for evolutions. In particular, we demonstrate that quantum speedup for the unstructured search using AQC type algorithms may only be achieved under very rigid control precision requirements.