Related papers: WKB and "Cubic-WKB" methods as an adiabatic approx…
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…
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…
We restate the adiabatic elimination approximation as the first term in a singular perturbation expansion. We use the invariant manifold formalism for singular perturbations in dynamical systems to identify systematic improvements on…
We introduce an adiabatic perturbation theory for quantum systems with degenerate energy spectra. This perturbative series enables one to rigorously establish conditions for the validity of the adiabatic theorem of quantum mechanics for…
Quantum adiabatic evolution is perceived as useful for binary quadratic programming problems that are a priori unconstrained. For constrained problems, it is a common practice to relax linear equality constraints as penalty terms in the…
It is challenged only recently that the precision attainable in any measurement of a physical parameter is fundamentally limited by the quantum Cram\'{e}r-Rao Bound (QCRB). Here, targeting at measuring parameters in strongly dissipative…
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
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…
The paper studies the structure of high-order adiabatic approximation of a wave function for slowly changing Hamiltonians. A constructive technique for explicit separation of fast and slow components of the wave function is developed. The…
We extend the adiabatic regularization method to spin-1/2 fields. The ansatz for the adiabatic expansion for fermionic modes differs significantly from the WKB-type template that works for scalar modes. We give explicit expressions for the…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…
We approximate given potentials by means of the specially introduced reference potentials. On the one hand their parameters may be easily found from the usual WKB integral for the given potential; on the other hand they allow a simple…
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.
We show that the adiabatic approximation for nonselfadjoint hamiltonians seems to induce two non-equal expressions for the geometric phase. The first one is related to the spectral projector involved in the adiabatic theorem, the other one…
The paper presents the results of a study of the possibility of using the WKB approach to describe Inhomogeneous Travelling-Wave Accelerating Sections (ITWAS). This possibility not only simplifies the calculation, but also allows the use of…
Adiabatic following has been an widely-employed technique for achieving near-complete population transfer in a two-level quantum mechanical system. The theoretical basis, however, could be generalized to a broad class of systems exhibiting…
We show that in a quantum adiabatic evolution, even though the adiabatic approximation is valid, the total phase of the final state indicated by the adiabatic theorem may evidently differ from the actual total phase. This invalidates the…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
In this paper, we present a U(1)-invariant expansion theory of the adiabatic process. As its application, we propose and discuss new sufficient adiabatic approximation conditions. In the new conditions, we find a new invariant quantity…
We generalize the standard quantum adiabatic approximation to the case of open quantum systems. We define the adiabatic limit of an open quantum system as the regime in which its dynamical superoperator can be decomposed in terms of…