Related papers: On adiabatic evolution for a general time-dependen…
Adiabatic approximation for quantum evolution is investigated quantitatively with addressing its dependence on the Berry connections. We find that, in the adiabatic limit, the adiabatic fidelity may uniformly converge to unit or diverge…
Quantum systems with chaotic classical counterparts cannot be treated by perturbative techniques or any kind of adiabatic approximations. This is so, in spite of the quantum suppression of classical chaos. We explicitly calculate the…
The quantum geometric tensor has established itself as a general framework for the analysis and detection of equilibrium phase transitions in isolated quantum systems. We propose a novel generalization of the quantum geometric tensor, which…
We import the tools of Morse theory to study quantum adiabatic evolution, the core mechanism in adiabatic quantum computations (AQC). AQC is computationally equivalent to the (pre-eminent paradigm) of the Gate model but less error-prone, so…
In this article it will be introduced a new theorem, can be considered a generalization of Hellmann-Feynman theorem[1]. The latter used in conjunction with the quantization of the free energy[2] of a quantum system allows to derive…
Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified…
We employ the recently developed multi-time scale averaging method to study the large time behavior of slowly changing (in time) Hamiltonians. We treat some known cases in a new way, such as the Zener problem, and we give another proof of…
In this paper, we discuss time evolution and adiabatic approximation in $PT$-symmetric quantum mechanics. we give the time evolving equation for a class of $PT$-symmetric Hamiltonians and some conditions of the adiabatic approximation for…
We prove an adiabatic theorem for general densities of observables that are sums of local terms in finite systems of interacting fermions, without periodicity assumptions on the Hamiltonian and with error estimates that are uniform in the…
We propose a variational principle to compute a quantum adiabatic brachistochrone (QAB) for open systems. Using the notion of "adiabatic speed" based on the energy gaps, we derive a Lagrangian associated to the functional measuring the time…
The adiabatic theorem is a fundamental result established in the early days of quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time…
Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in [E. Farhi, et al., arXiv:quant-ph/0208135]. The algorithm is applied to a random binary optimization problem (a version…
We prove an adiabatic theorem for the evolution of spectral data under a weak additive perturbation in the context of a system without an intrinsic time scale. For continuous functions of the unperturbed Hamiltonian the convergence is in…
The theory of adiabatic invariants has a long history and important applications in physics but is rarely rigorous. Here we treat exactly the general time-dependent 1-D harmonic oscillator, $\ddot{q} + \omega^2(t) q=0$ which cannot be…
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential…
We derive an adiabatic theorem for Markov chains using well known facts about mixing and relaxation times. We discuss the results in the context of the recent developments in adiabatic quantum computation.
The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $\tau$ is upper bounded by $C/\tau$ for some positive…
In quantum adiabatic algorithm, as the adiabatic parameter $s(t)$ changes slowly from zero to one with finite rate, a transition to excited states inevitably occurs and this induces an intrinsic computational error. We show that this…