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

Chinese Physics B

Transitionless driving on local adiabatic quantum search algorithm

Feng‐Guang Li, Wan‐Su Bao, Shuo Zhang, Xiang Wang, He-Liang Huang, Tan Li, Bo-wen Ma

Published Jan 1, 2018• 3 citations
Publisher

Abstract

We apply the transitionless driving on the local adiabatic quantum search algorithm to speed up the adiabatic process. By studying quantum dynamics of the adiabatic search algorithm with the equivalent two-level system, we derive the transitionless driving Hamiltonian for the local adiabatic quantum search algorithm. We found that when adding a transitionless quantum driving term H D ( t ) on the local adiabatic quantum search algorithm, the success rate is 1 exactly with arbitrary evolution time by solving the time-dependent Schr¨odinger equation in eigen-picture. Moreover, we show the reason for the drastic decrease of the evolution time is that the driving Hamiltonian increases the lowest eigenvalues to a maximum of O ( N ) .

DOI
10.1088/1674-1056/27/1/010308

Related papers

Transitionless driving on adiabatic search algorithm

Sangchul Oh, Sabre Kais

We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics.

arXiv:1406.7138•The Journal of Chemical Physics•Dec 9, 2014•10 citations

Success Rate Versus Finite Run Time in Local Adiabatic Quantum Search Algorithm*

Feng‐Guang Li, Wan‐Su Bao, Xiang 翔 Wang 汪 +5 more

Abstract In adiabatic quantum algorithm, the success rate is approximately equal to 1 while the run time satisfies the adiabatic condition. But the relation between the short run time and success rate for adiabatic quantum algorithm is poorly understood. In this paper, we study the success rate of local adiabatic quantum search algorithm with an arbitrary finite run time (non-adiabatic evolution). By solving the time-independent Schrödinger equation, we obtain differential equations to calculate the success rate. The differential equations show that the success rate is closely related to the adiabatic parameter s t . Utilize the differential equations, we give the function of success rate versus run time in local adiabatic search numerically. The result indirectly verifies that T ∼ O ( N ) is optimal in local adiabatic search.

Communications in Theoretical Physics•Apr 1, 2017•2 citations

Generalized transitionless quantum driving for open quantum systems

Alan C. Santos, M. S. Sarandy

A general approach for transitionless quantum driving in open quantum systems is introduced. Under the assumption of adiabatic evolution for time-local master equations, we derive the generalized transitionless Lindbladian required to implement a shortcut to adiabaticity in an open-system scenario. The general counterdiabatic Lindbladian obtained accounts for a phase freedom, which translates into a set of free parameters throughout the dynamics. We discuss how our generalized approach allows us to recover the transitionless Lindbladian introduced by Vacanti et al. [G. Vacanti et al. New J. Phys. 16, 053017 (2014)]. We show how to engineer time-independent master equations that provide the same dynamics as the time-dependent master equation provided by the standard transitionless quantum driving in open systems. We illustrate our results by applying them both to the adiabatic Deutsch algorithm under dephasing and to the Landau-Zener Hamiltonian under a bit phase flip.

arXiv:2109.11695•Physical Review A•Dec 13, 2021•19 citations

Transitionless quantum driving for spin systems

Kazutaka Takahashi

We apply the method of transitionless quantum driving for time-dependent quantum systems to spin systems. For a given Hamiltonian, the driving Hamiltonian is constructed so that the adiabatic states of the original system obey the Schrödinger equation. For several typical systems such as the XY spin chain and the Lipkin-Meshkov-Glick model, the driving Hamiltonian is constructed explicitly. We discuss possible interesting situations when the driving Hamiltonian becomes time independent and when the driving Hamiltonian is equivalent to the original one. For many-body systems, a crucial problem occurs at the quantum phase transition point where the energy gap between the ground and first excited states becomes zero. We discuss how the defect can be circumvented in the present method.

arXiv:1209.3153•Physical Review E•Jun 12, 2013•117 citations

Energy and efficiency of adiabatic quantum search algorithms

Saurya Das, Randy Kobes, G. Kunstatter

We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a database of N items. In particular, we examine the effects on the computation time of adding energy to the system. We find that by increasing the lowest eigenvalue of the time-dependent Hamiltonian temporarily to a maximum of ∝√ N , it is possible to do the calculation in constant time. This leads us to derive the general theorem which provides the adiabatic analogue of the √ N bound of conventional quantum searches. The result suggests that the action associated with the oracle term in the time-dependent Hamiltonian is a direct measure of the resources required by the adiabatic quantum search.

arXiv:quant-ph/0204044•Journal of Physics A Mathematical and General•Mar 6, 2003•34 citations

Quantum search by local adiabatic evolution

Jérémie Roland, Nicolas J. Cerf

The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N},$ where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.

arXiv:quant-ph/0107015•Physical Review A•Mar 26, 2002•629 citations
We apply the transitionless driving on the local adiabatic quantum search algorithm to speed up the adiabatic process. By studying quantum dynamics of the adiabatic search algorithm with the equivalent two-level system, we derive the transitionless driving Hamiltonian for the local adiabatic quantum search algorithm. We found that when adding a transitionless quantum driving term H D ( t ) on the local adiabatic quantum search algorithm, the success rate is 1 exactly with arbitrary evolution time by solving the time-dependent Schr¨odinger equation in eigen-picture. Moreover, we show the reason for the drastic decrease of the evolution time is that the driving Hamiltonian increases the lowest eigenvalues to a maximum of O ( N ) .
We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics.
Abstract In adiabatic quantum algorithm, the success rate is approximately equal to 1 while the run time satisfies the adiabatic condition. But the relation between the short run time and success rate for adiabatic quantum algorithm is poorly understood. In this paper, we study the success rate of local adiabatic quantum search algorithm with an arbitrary finite run time (non-adiabatic evolution). By solving the time-independent Schrödinger equation, we obtain differential equations to calculate the success rate. The differential equations show that the success rate is closely related to the adiabatic parameter s t . Utilize the differential equations, we give the function of success rate versus run time in local adiabatic search numerically. The result indirectly verifies that T ∼ O ( N ) is optimal in local adiabatic search.
A general approach for transitionless quantum driving in open quantum systems is introduced. Under the assumption of adiabatic evolution for time-local master equations, we derive the generalized transitionless Lindbladian required to implement a shortcut to adiabaticity in an open-system scenario. The general counterdiabatic Lindbladian obtained accounts for a phase freedom, which translates into a set of free parameters throughout the dynamics. We discuss how our generalized approach allows us to recover the transitionless Lindbladian introduced by Vacanti et al. [G. Vacanti et al. New J. Phys. 16, 053017 (2014)]. We show how to engineer time-independent master equations that provide the same dynamics as the time-dependent master equation provided by the standard transitionless quantum driving in open systems. We illustrate our results by applying them both to the adiabatic Deutsch algorithm under dephasing and to the Landau-Zener Hamiltonian under a bit phase flip.
We apply the method of transitionless quantum driving for time-dependent quantum systems to spin systems. For a given Hamiltonian, the driving Hamiltonian is constructed so that the adiabatic states of the original system obey the Schrödinger equation. For several typical systems such as the XY spin chain and the Lipkin-Meshkov-Glick model, the driving Hamiltonian is constructed explicitly. We discuss possible interesting situations when the driving Hamiltonian becomes time independent and when the driving Hamiltonian is equivalent to the original one. For many-body systems, a crucial problem occurs at the quantum phase transition point where the energy gap between the ground and first excited states becomes zero. We discuss how the defect can be circumvented in the present method.
We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a database of N items. In particular, we examine the effects on the computation time of adding energy to the system. We find that by increasing the lowest eigenvalue of the time-dependent Hamiltonian temporarily to a maximum of ∝√ N , it is possible to do the calculation in constant time. This leads us to derive the general theorem which provides the adiabatic analogue of the √ N bound of conventional quantum searches. The result suggests that the action associated with the oracle term in the time-dependent Hamiltonian is a direct measure of the resources required by the adiabatic quantum search.
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order N,\sqrt{N},N​, where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.