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

Dynamics of adiabatic quantum search

Artem Pimachev

Published Jan 1, 2015• 0 citations
Publisher

Abstract

We describe a class of the Hamiltonians, for which the local adiabaticity condition is satisfied automatically. We consider the controllable adiabatic interpolations between the initial and final Hamiltonians. We show that the quantum search by the adiabatic quantum computation can be mapped into this class. Assuming that the interpolation is infinitely differentiable and the target adiabatic ground state is nondegenerate and separated by a gap from the rest of the spectrum, it is shown that one can obtain an exponentially small error in the algorithm run time T betweenthe finale adiabatic eigenstate and the actual state of the system. The optimal for quantum search scaling of T as square root of the system size is also satisfied.

DOI
10.25549/usctheses-m2718

Related papers

Adiabatic approximation with exponential accuracy for many-body systems and quantum computation

Daniel A. Lidar, Ali T. Rezakhani, Alioscia Hamma

We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real-time axis, that some number of its time derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is nondegenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time derivative of the Hamiltonian divided by the cube of the minimal gap.

arXiv:0808.2697•Journal of Mathematical Physics•Oct 1, 2009•172 citations

Adiabatic approximation with better than exponential accuracy for many-body systems and quantum computation

Daniel A. Lidar, A. T. Rezakhani, Alioscia Hamma

We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real time axis, that some number of its time-derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is non-degenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time-derivative of the Hamiltonian, divided by the cube of the minimal gap.

•Aug 20, 2008•4 citations

Quantum Computation by Adiabatic Evolution

Edward Farhi, Jeffrey Goldstone, Sam Gutmann +1 more

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.

arXiv:quant-ph/0001106•Jan 28, 2000•2,419 citations

Exploring adiabatic quantum trajectories via optimal control

Constantin Brif, Matthew D Grace, Mohan Sarovar +1 more

Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the evolution time is finite, the degree of adiabaticity (quantified in this work as the average ground-state population during evolution) depends on the particulars of a dynamic trajectory associated with a given set of control functions. We use quantum optimal control theory with a composite objective functional to numerically search for controls that achieve the target final state with a high fidelity while simultaneously maximizing the degree of adiabaticity. Exploring the properties of optimal adiabatic trajectories in model systems elucidates the dynamic mechanisms that suppress unwanted excitations from the ground state. Specifically, we discover that the use of multiple control functions makes it possible to access a rich set of dynamic trajectories, some of which attain a significantly improved performance (in terms of both fidelity and adiabaticity) through the increase of the energy gap during most of the evolution time.

arXiv:1310.3443•New Journal of Physics•Jun 24, 2014•38 citations

Comments on adiabatic quantum algorithms

Mary Beth Ruskai

Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an eigenvalue gap. We show that, even without the assumption of an eigenvalue gap, other standard arguments can be used to show that a large class of Hamiltonians proposed for adiabatic quantum computation have unique ground states. We also discuss some of the issues which arise in trying to analyze the behavior of the eigenvalue gap. In particular, we propose several mechanisms for modifying to final Hamiltonian to perform an adiabatic search with efficiency comparable to that for 3-SAT. We also propose the use of randomly defined final Hamiltonians as a mechanism for analyzing the generic spectral behavior of the interpolating Hamiltonians associated with problems which lack sufficent structure to be amenable to efficient classical algorithms.

arXiv:quant-ph/0203127•Contemporary mathematics - American Mathematical Society•Jan 1, 2002•10 citations

Quantum adiabatic evolutions that can't be used to design efficient algorithms

Zhaohui Wei, Mingsheng Ying

Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic evolution with a interpolation path is too simple, the minimal gap between the ground state and the first excited state of this quantum adiabatic evolution is an inverse exponential distance. Thus quantum adiabatic evolutions of this kind can't be used to design efficient quantum algorithms. Similarly, we show that a quantum adiabatic evolution with a simple final hamiltonian also has a long running time, which suggests that some functions can't be minimized efficiently by any quantum adiabatic evolution with a interpolation path.

arXiv:quant-ph/0604077•Apr 11, 2006•6 citations
We describe a class of the Hamiltonians, for which the local adiabaticity condition is satisfied automatically. We consider the controllable adiabatic interpolations between the initial and final Hamiltonians. We show that the quantum search by the adiabatic quantum computation can be mapped into this class. Assuming that the interpolation is infinitely differentiable and the target adiabatic ground state is nondegenerate and separated by a gap from the rest of the spectrum, it is shown that one can obtain an exponentially small error in the algorithm run time T betweenthe finale adiabatic eigenstate and the actual state of the system. The optimal for quantum search scaling of T as square root of the system size is also satisfied.
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real-time axis, that some number of its time derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is nondegenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time derivative of the Hamiltonian divided by the cube of the minimal gap.
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real time axis, that some number of its time-derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is non-degenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time-derivative of the Hamiltonian, divided by the cube of the minimal gap.
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the evolution time is finite, the degree of adiabaticity (quantified in this work as the average ground-state population during evolution) depends on the particulars of a dynamic trajectory associated with a given set of control functions. We use quantum optimal control theory with a composite objective functional to numerically search for controls that achieve the target final state with a high fidelity while simultaneously maximizing the degree of adiabaticity. Exploring the properties of optimal adiabatic trajectories in model systems elucidates the dynamic mechanisms that suppress unwanted excitations from the ground state. Specifically, we discover that the use of multiple control functions makes it possible to access a rich set of dynamic trajectories, some of which attain a significantly improved performance (in terms of both fidelity and adiabaticity) through the increase of the energy gap during most of the evolution time.
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an eigenvalue gap. We show that, even without the assumption of an eigenvalue gap, other standard arguments can be used to show that a large class of Hamiltonians proposed for adiabatic quantum computation have unique ground states. We also discuss some of the issues which arise in trying to analyze the behavior of the eigenvalue gap. In particular, we propose several mechanisms for modifying to final Hamiltonian to perform an adiabatic search with efficiency comparable to that for 3-SAT. We also propose the use of randomly defined final Hamiltonians as a mechanism for analyzing the generic spectral behavior of the interpolating Hamiltonians associated with problems which lack sufficent structure to be amenable to efficient classical algorithms.
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic evolution with a interpolation path is too simple, the minimal gap between the ground state and the first excited state of this quantum adiabatic evolution is an inverse exponential distance. Thus quantum adiabatic evolutions of this kind can't be used to design efficient quantum algorithms. Similarly, we show that a quantum adiabatic evolution with a simple final hamiltonian also has a long running time, which suggests that some functions can't be minimized efficiently by any quantum adiabatic evolution with a interpolation path.