Related papers: A note on adiabatic theorem for Markov chains and …
The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the…
We construct a measure for the adiabatic contribution to quantum transitions in an arbitrary basis, tackling the generic complex case where dynamics is only partially adiabatic, simultaneously populates several eigenstates and transitions…
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…
We develop a generic method in Liouville space to describe the dissipative dynamics of coherent interacting quantum dots with adiabatic time dependence beyond linear response. We show how the adiabatic response can be related to effective…
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…
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 [Farhi et al.,…
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…
One of the difficulties in adiabatic quantum computation is the limit on the computation time. Here we propose two schemes to speed-up the adiabatic evolution. To apply this controlled adiabatic evolution to adiabatic quantum computation,…
The consistency of quantum adiabatic theorem has been doubted recently. It is shown in the present paper that the difference between the adiabatic solution and the exact solution to the Schrodinger equation with a slowly changing driving…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…
We introduce an approach to scattering problems in theories with non-Hermitian Hamiltonian, usually known as PT-symmetric quantum theories, by means of the adiabatic switching of the interaction. The modifications of usual methods needed to…
We examine the use of adiabatic quantum algorithms to solve structured, or nested, search problems. We construct suitable time dependent Hamiltonians and derive the computation times for a general class of nested searches involving n…
We give a sufficient condition for the quantum adiabatic approximation, which is quantitative and can be used to estimate error caused by this approximation. We also discuss when the traditional condition is sufficient.
By introducing a temporal change timescale $\tau_{\text{A}}(t)$ for the time-dependent system Hamiltonian, a general formulation of the Markovian quantum master equation is given to go well beyond the adiabatic regime. In appropriate…
We have studied the decoherence properties of adiabatic quantum computation (AQC) in the presence of in general non-Markovian, e.g., low-frequency, noise. The developed description of the incoherent Landau-Zener transitions shows that the…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
The use of the adiabatic approximation in practical applications, as in adiabatic quantum computation, demands an assessment of the errors made in finite-time evolutions. Aiming at such scenarios, we derive bounds relating error and…
In a quantum system with a smoothly and slowly varying Hamiltonian, which approaches a constant operator at times $t\to \pm \infty$, the transition probabilities between adiabatic states are exponentially small. They are characterized by an…
We present an analysis of the adiabatic approximation to understand when it applies, in view of the recent criticisms and studies for the validity of the adiabatic theorem. We point out that this approximation is just the leading order of a…
There is evidence that taking the time average of the work performed by a thermally isolated system effectively "transforms" the adiabatic process into an isothermal one. This approach allows inherent quantities of adiabatic processes to be…