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.
In 2004 Ambainis and Regev formulated a certain form of quantum adiabatic theorem and provided an elementary proof which is especially accessible to computer scientists. Their result is achieved by discretizing the total adiabatic evolution into a sequence of unitary transformations acting on the quantum system. Here we continue this line of study by providing another elementary and shorter proof with improved bounds. Our key finding is a succinct integral representation of the difference between the target and the actual states, which yields an accurate estimation of the approximation error. Our proof can be regarded as a "continuous" version of the work by Ambainis and Regev. As applications, we show how to adiabatically prepare an arbitrary qubit state from an initial state.
The adiabatic theorem is a powerful result concerning the evolution of quantum mechanical systems. Intuitively, it states the following: suppose we want to study the evolution of a quantum mechanical system governed by a given Hamiltonian
H (Def. 6.1), and the initial state of the system is the eigenstate of
H corresponding to its lowest eigenvalue. The laws of quantum physics tell us that the evolution of the system over time follows the Schrüdinger equation, Eq. (6.1). Suppose now that the Hamiltonian is not fixed, but rather, it changes very slowly over time, so that the evolution of the system is described by the differential equation
idtd∣ψ(t)⟩=H(t)∣ψ(t)⟩, and
H(t) is slowly changing. If, for any value of the time parameter
t, there is always a gap between the lowest eigenvalue of
H(t) and all other eigenvalues, then the adiabatic theorem asserts that the state of the system always remains in an eigenstate with the lowest eigenvalue throughout the evolution. One specific case of interest in this chapter occurs when the time-dependent Hamiltonian
H(t) varies from an initial (time-independent) Hamiltonian
HI to a final Hamiltonian
HF. If the change happens slowly, and the initial state of the system is an eigenstate of
HI with minimum eigenvalue, the adiabatic theorem asserts that the evolution eventually leads to the eigenstate with minimum eigenvalue of the final Hamiltonian
HF. This result can be used for optimization: imagine that the initial Hamiltonian encodes an easy problem for which we can construct the eigenstate with minimum eigenvalue, and the final Hamiltonian encodes a difficult optimization problem whose solution is given by the eigenstate with minimum eigenvalue. By the adiabatic theorem, evolving the eigenstate of the initial Hamiltonian while slowly changing the Hamiltonian into the final one leads to the solution of the difficult optimization problem. Of course we need to know how slowly
HI should be changed into
HF. The adiabatic theorem is at the heart of the quantum approximate optimization algorithm (QAOA), a framework that has been widely used to implement optimization algorithms on existing quantum hardware, because it has low requirements of quantum resources–although it does not guarantee improvements over classical algorithms in general. In this chapter we first discuss the adiabatic theorem, and then give an overview of QAOA.
We prove the adiabatic theorem for quantum evolution without the traditional gap condition. We show that the theorem holds essentially in all cases where it can be formulated. In particular, our result implies that the adiabatic theorem holds also for eigenvalues embedded in the continuous spectrum. If there is information on the Hölder continuity of the spectral measure, then one can also estimate the rate at which the adiabatic limit is approached. The adiabatic theorem of Quantum Mechanics describes the long time behavior of the solutions of an initial value problem where the Hamiltonian generating the evolution depends slowly in time. Traditionally, the theorem is stated for Hamiltonians that have an eigenvalue which is separated by a gap from the rest of the spectrum. Folk wisdom is that a gap condition is a sine qua non for the adiabatic theorem to hold. In particular, according to this folk wisdom, one does not expect a general adiabatic theorem for Hamiltonians that have an eigenvalue embedded in, say, the continuous spectrum. Our purpose is to show that this folk wisdom is wrong, and there is a general adiabatic theorem without a gap condition. All one really needs for the adiabatic theorem is a spectral projection for the Hamiltonian that depends smoothly on time.
The quantum adiabatic theorem is the basis of adiabatic quantum computation. However, the exact necessary and sufficient conditions for adiabatic evolution are still under debate. We discuss the adiabatic condition of a system undergoing a special evolution route, and obtain an explicit formula that is necessary and sufficient for the adiabatic evolution in this route. Based on this formula, we find that the traditional adiabatic condition is neither sufficient nor necessary. Finally, we show that no adiabatic process can occur even the evolution speed goes to 0 in some examples, which is surprising since the adiabatic theorem states that if the evolution of a system is slow enough, the adiabatic process could occur.