Related papers: Adiabatic Conditions and the Uncertainty Relation
We discuss the application of the adiabatic perturbation theory to analyze the dynamics in various systems in the limit of slow parametric changes of the Hamiltonian. We first consider a two-level system and give an elementary derivation of…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as 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…
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…
We consider one-dimensional classical time-dependent Hamiltonian systems with quasi-periodic orbits. It is well-known that such systems possess an adiabatic invariant which coincides with the action variable of the Hamiltonian formalism. We…
We introduce non-adiabatic semiclassical dressed states for a quantum system interacting with an electromagnetic field of variable amplitude and phase, and presence of dumping. We also introduce a generalized adiabatic condition, which…
We introduce a modified model where h-dependent artificial interface conditions, occurring at the boundary of an interaction region, allow to obtain adiabatic approximations for the relevant resonant states connected to the quantum…
We show that recent results on adiabatic theory for interacting gapped many-body systems on finite lattices remain valid in the thermodynamic limit. More precisely, we prove a generalised super-adiabatic theorem for the automorphism group…
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 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 transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialised state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible.…
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$.…
We present a new quantum adiabatic theorem that allows one to rigorously bound the adiabatic timescale for a variety of systems, including those described by unbounded Hamiltonians. Our bound is geared towards the qubit approximation of…
Keldysh field theory, based on adiabatic assumptions, serves as an widely used framework for addressing nonequilibrium many-body systems. Nonetheless, the validity of such adiabatic assumptions when addressing interacting Gibbs states…
We discuss a toy model for adiabatic quantum computation which displays some phenomenological properties expected in more realistic implementations. This model has two free parameters: the adiabatic evolution parameter $s$ and the $\alpha$…
We study the relation between the models commonly used to describe the dynamics of nonresonantly pumped exciton-polariton condensates, namely the ones described by the complex Ginzburg-Landau equation, and by the open-dissipative…
A proof of the adiabatic theorem for quantum systems whose time evolution proceeds along discrete time, e.g., quantum maps and quantum circuits, is shown.
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled…
Since the discovery of adiabatic quantum computing, a need has arisen for rigorously proven bounds for the error in the adiabatic approximation. We present in this paper, a rigorous and elementary derivation of upper and lower bounds on the…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…