Related papers: Failure of geometric electromagnetism in the adiab…
On the background of the Born-Oppenheimer (adiabatic) approximation, we investigate the geometrical and topological structure in the theory of quantum gravity by using the path integral method and halfclassical approximation. As we know,…
We introduce and analyze several low-dimensional scattering systems that exhibit geometric phase phenomena. The systems are fully solvable and we compare exact solutions of them with those obtained in a Born-Oppenheimer projection…
We present an optimized adiabatic quantum schedule for unstructured search building on the original approach of Roland and Cerf [Phys. Rev. A 65, 042308 (2002)]. Our schedule adiabatically varies the Hamiltonian even more rapidly at the…
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…
The recent detection of gravitational waves emanating from inspiralling black hole binaries has triggered a renewed interest in the dynamics of relativistic two-body systems. The conservative part of the latter are given by Hamiltonian…
Quantum systems with adiabatic classical parameters are widely studied, e.g., in the modern holonomic quantum computation. We here provide complete geometric quantization of a Hamiltonian system with time-dependent parameters, without the…
We derive a nearly optimal upper bound on the running time in the adiabatic theorem for a switching family of Hamiltonians. We assume the switching Hamiltonian is in the Gevrey class $G^\alpha$ as a function of time, and we show that the…
The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in $1/T$, based on the lowest non-zero derivative of the…
Perturbed Hamming weight problems serve as examples of optimization instances for which the adiabatic algorithm provably out performs classical simulated annealing. In this work we study the efficiency of the adiabatic algorithm for solving…
The Hannay angle has been previously studied for a celestial circular restricted three-body system by means of an adiabatic approach. In the present work, three main results are obtained. Firstly, a formal connection between perturbation…
We develop the method of adiabatic tracking for photo- and magneto-association of Bose-Einstein atomic condensates with models that include Kerr type nonlinearities. We show that the inclusion of these terms can produce qualitatively…
When dealing with satellites orbiting a central body on a highly elliptical orbit, it is necessary to consider the effect of gravitational perturbations due to external bodies. Indeed, these perturbations can become very important as soon…
The techniques of shortcuts to adiabaticity have been proposed to accelerate the "slow" adiabatic processes in various quantum systems with the applications in quantum information processing. In this paper, we study the counter-diabatic…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
We prove an adiabatic theorem that applies at timescales short of the typical adiabatic limit. Our proof analyzes the stability of solutions to Schrodinger's equation under perturbation. We directly characterize cross-subspace effects of…
Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing…
Topological phases emerge as the parameters of a quantum system vary with time. Under the adiabatic approximation, the time dependence can be eliminated, allowing the Berry topological phase to be obtained from a closed trajectory in…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
The level crossing problem is neatly formulated by the second quantized formulation, which exhibits a hidden local gauge symmetry. The analysis of geometric phases is reduced to a simple diagonalization of the Hamiltonian. If one…
Understanding NP-complete problems is a central topic in computer science. This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer.…