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:1406.7138 · The Journal of Chemical Physics

Transitionless driving on adiabatic search algorithm

Sangchul Oh, Sabre Kais

Published Dec 9, 2014• 10 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1063/1.4903451

Related papers

Transitionless driving on local adiabatic quantum search algorithm

Feng‐Guang Li, Wan‐Su Bao, Shuo Zhang +4 more

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 ) .

Chinese Physics B•Jan 1, 2018•3 citations

Shortcuts to adiabaticity for non-Hermitian systems

Sara Ibañez, S. Martínez-Garaot, Xi Chen +2 more

Adiabatic processes driven by non-Hermitian, time-dependent Hamiltonians may be sped up by generalizing inverse engineering techniques based on counter-diabatic (transitionless driving) algorithms or on dynamical invariants. We work out the basic theory and examples described by two-level Hamiltonians: the acceleration of rapid adiabatic passage with a decaying excited level and of the dynamics of a classical particle on an expanding harmonic oscillator.

arXiv:1106.2776•Physical Review A•Aug 29, 2011•123 citations

Lewis-Riesenfeld invariants and transitionless quantum driving

Xi Chen, E. Torrontegui, Juan Gonzalo Muga

Different methods have been recently put forward and implemented experimentally to inverse engineer the time-dependent Hamiltonian of a quantum system and accelerate slow adiabatic processes via nonadiabatic shortcuts. In the ``transitionless quantum driving'' proposed by Berry, shortcut Hamiltonians are designed so that the system follows exactly, in an arbitrarily short time, the approximate adiabatic path defined by a reference Hamiltonian. A different approach is based on first designing a Lewis-Riesenfeld invariant to carry the eigenstates of a Hamiltonian from specified initial to final configurations, again in an arbitrary time, and then constructing from the invariant the transient Hamiltonian that connects these boundary configurations. We show that the two approaches, apparently quite different in form and so far in results, are, in fact, strongly related and potentially equivalent, so that the inverse-engineering operations in one of them can be reinterpreted and understood in terms of the concepts and operations of the other one. We study, as explicit examples, expansions of time-dependent harmonic traps and the state preparation of two-level systems.

arXiv:1102.3449•Physical Review A•Jun 22, 2011•377 citations

Generating shortcuts to adiabaticity in quantum and classical dynamics

Christopher Jarzynski

Transitionless quantum driving achieves adiabatic evolution in a hurry, using a counterdiabatic Hamiltonian to stifle nonadiabatic transitions. Here this shortcut to adiabaticity is cast in terms of a generator of adiabatic transport. This yields a classical analog of transitionless driving, and provides a strategy for constructing quantal counterdiabatic Hamiltonians. As an application of this framework, exact classical and quantal counterdiabatic terms are obtained for a particle in a box and for even-power-law potentials in one degree of freedom.

arXiv:1305.4967•Physical Review A•Oct 4, 2013•159 citations

Continuous-time quantum search and time-dependent two-level quantum systems

Carlo Cafaro, Paul M. Alsing

It was recently emphasized by Byrnes, Forster and Tessler [Phys. Rev. Lett. 120 (2018) 060501] that the continuous-time formulation of Grover’s quantum search algorithm can be intuitively understood in terms of Rabi oscillations between the source and the target subspaces. In this work, motivated by this insightful remark and starting from the consideration of a time-independent generalized quantum search Hamiltonian as originally introduced by Bae and Kwon [Phys. Rev. A 66 (2002) 012314], we present a detailed investigation concerning the physical connection between quantum search Hamiltonians and exactly solvable time-dependent two-level quantum systems. Specifically, we compute in an exact analytical manner the transition probabilities from a source state to a target state in a number of physical scenarios specified by a spin-[Formula: see text] particle immersed in an external time-dependent magnetic field. In particular, we analyze both the periodic oscillatory as well as the monotonic temporal behaviors of such transition probabilities and, moreover, explore their analogy with characteristic features of Grover-like and fixed-point quantum search algorithms, respectively. Finally, we discuss from a physics standpoint the connection between the schedule of a search algorithm, in both adiabatic and nonadiabatic quantum mechanical evolutions, and the control fields in a time-dependent driving Hamiltonian.

arXiv:1903.11188•International Journal of Quantum Information•Apr 1, 2019•23 citations

Accuracy versus run time in an adiabatic quantum search

A. T. Rezakhani, Artem Pimachev, Daniel A. Lidar

Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance yet is often poorly understood. We study the dynamics of a continuous time, adiabatic quantum search algorithm and find rigorous results relating the accuracy and the run time. Proceeding with estimates, we show that under fairly general circumstances the adiabatic algorithmic error exhibits a behavior with two discernible regimes: The error decreases exponentially for short times and then decreases polynomially for longer times. We show that the well-known quadratic speedup over classical search is associated only with the exponential error regime. We illustrate the results through examples of evolution paths derived by minimization of the adiabatic error. We also discuss specific strategies for controlling the adiabatic error and run time.

arXiv:1008.0863•Physical Review A•Nov 9, 2010•69 citations
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.
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 ) .
Different methods have been recently put forward and implemented experimentally to inverse engineer the time-dependent Hamiltonian of a quantum system and accelerate slow adiabatic processes via nonadiabatic shortcuts. In the ``transitionless quantum driving'' proposed by Berry, shortcut Hamiltonians are designed so that the system follows exactly, in an arbitrarily short time, the approximate adiabatic path defined by a reference Hamiltonian. A different approach is based on first designing a Lewis-Riesenfeld invariant to carry the eigenstates of a Hamiltonian from specified initial to final configurations, again in an arbitrary time, and then constructing from the invariant the transient Hamiltonian that connects these boundary configurations. We show that the two approaches, apparently quite different in form and so far in results, are, in fact, strongly related and potentially equivalent, so that the inverse-engineering operations in one of them can be reinterpreted and understood in terms of the concepts and operations of the other one. We study, as explicit examples, expansions of time-dependent harmonic traps and the state preparation of two-level systems.
Transitionless quantum driving achieves adiabatic evolution in a hurry, using a counterdiabatic Hamiltonian to stifle nonadiabatic transitions. Here this shortcut to adiabaticity is cast in terms of a generator of adiabatic transport. This yields a classical analog of transitionless driving, and provides a strategy for constructing quantal counterdiabatic Hamiltonians. As an application of this framework, exact classical and quantal counterdiabatic terms are obtained for a particle in a box and for even-power-law potentials in one degree of freedom.
It was recently emphasized by Byrnes, Forster and Tessler [Phys. Rev. Lett. 120 (2018) 060501] that the continuous-time formulation of Grover’s quantum search algorithm can be intuitively understood in terms of Rabi oscillations between the source and the target subspaces. In this work, motivated by this insightful remark and starting from the consideration of a time-independent generalized quantum search Hamiltonian as originally introduced by Bae and Kwon [Phys. Rev. A 66 (2002) 012314], we present a detailed investigation concerning the physical connection between quantum search Hamiltonians and exactly solvable time-dependent two-level quantum systems. Specifically, we compute in an exact analytical manner the transition probabilities from a source state to a target state in a number of physical scenarios specified by a spin-[Formula: see text] particle immersed in an external time-dependent magnetic field. In particular, we analyze both the periodic oscillatory as well as the monotonic temporal behaviors of such transition probabilities and, moreover, explore their analogy with characteristic features of Grover-like and fixed-point quantum search algorithms, respectively. Finally, we discuss from a physics standpoint the connection between the schedule of a search algorithm, in both adiabatic and nonadiabatic quantum mechanical evolutions, and the control fields in a time-dependent driving Hamiltonian.
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance yet is often poorly understood. We study the dynamics of a continuous time, adiabatic quantum search algorithm and find rigorous results relating the accuracy and the run time. Proceeding with estimates, we show that under fairly general circumstances the adiabatic algorithmic error exhibits a behavior with two discernible regimes: The error decreases exponentially for short times and then decreases polynomially for longer times. We show that the well-known quadratic speedup over classical search is associated only with the exponential error regime. We illustrate the results through examples of evolution paths derived by minimization of the adiabatic error. We also discuss specific strategies for controlling the adiabatic error and run time.