Related papers: Stable Adiabatic Times for Markov Chains
In this paper, we construct an adiabatic invariant for a large 1--$d$ lattice of particles, which is the so called Klein Gordon lattice. The time evolution of such a quantity is bounded by a stretched exponential as the perturbation…
We derive an adiabatic theory for a stochastic differential equation, $ \varepsilon\, \mathrm{d} X(s) = L_1(s) X(s)\, \mathrm{d} s + \sqrt{\varepsilon} L_2(s) X(s) \, \mathrm{d} B_s, $ under a condition that instantaneous stationary states…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
We revisit the time-adiabatic theorem of quantum mechanics and show that it can be extended to weakly nonlinear situations, that is to nonlinear Schroedinger equations in which either the nonlinear coupling constant or, equivalently, the…
Adiabatic variation of the parameters of a chaotic system results in a fluctuating reaction force. In the leading order in the adiabaticity parameter, a dissipative force, that is present in classical mechanics was found to vanish in…
We consider a time-dependent two-level quantum system interacting with a free Boson reservoir. The coupling is energy conserving and depends slowly on time, as does the system Hamiltonian, with a common adiabatic parameter $\varepsilon$.…
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint…
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…
Adiabatic quantum computing is a powerful framework for state preparation, while its evolution time often scales quadratically in the inverse Hamiltonian spectral gap, leading to sub-optimal computational complexity. In this work, we…
Conditions for the validity of the quantum adiabatic approximation are analyzed. For the case of linear Hamiltonians, a simple and general sufficient condition is derived, which is valid for arbitrary spectra and any kind of time variation.…
The quantum adiabatic theorem is a fundamental result in quantum mechanics, with a multitude of applications, both theoretical and practical. Here, we investigate the dynamics of adiabatic processes for quantum many-body systems %in detail…
We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We…
The time evolution of the adiabatic piston problem and the consequences of its stochastic motion are investigated. The model is a one dimensional piston of mass $M$ separating two ideal fluids made of point particles with mass $m\ll M$. For…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…
In a time-orbiting-potential magnetic trap the neutral atoms are confined by means of an inhomogeneous magnetic field superimposed to an uniform rotating one. We perform an analytic study of the atomic motion by taking into account the…
In the real-time manipulation of quantum states, it is necessary to dynamically control the parameters of the system's Hamiltonian. We have studied the survival probability during the conveyance of a particle by a trapping potential, where…
Adiabatic quantum gate implementation generally takes longer time, which is disadvantageous in view of decoherence. In this report we implement several essential one-qubit quantum gates nonadiabatically by making use of a dynamical…
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…
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…