Related papers: Accuracy of the quantum adiabatic theorem in its o…
For slow--fast quantum systems, we compute first corrections to the quantum action and to the effective slow Hamiltonian.
Quantum control could be implemented by varying the system Hamiltonian. According to adiabatic theorem, a slowly changing Hamiltonian can approximately keep the system at the ground state during the evolution if the initial state is a…
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…
We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows…
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…
We study quantum adiabatic dynamics, where the slowly moving field is influenced by system's state (feedback). The information for the feedback is gained from non-disturbating measurements done on an ensemble of identical non-interacting…
The minimum work principle states that work done on a thermally isolated equilibrium system is minimal for the adiabatically slow (reversible) realization of a given process. This principle, one of the formulations of the second law, is…
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…
Physical implementations of quantum computation must be scrutinized about their reliability under real conditions, in order to be considered as viable candidates. Among the proposed models, those based on adiabatic quantum dynamics have…
Duality is considered for the perturbation theory by deriving, given a series solution in a small parameter, its dual series with the development parameter being the inverse of the other. A dual symmetry in perturbation theory is…
We iteratively apply a recently formulated adiabatic theorem for the strong-coupling limit in finite-dimensional quantum systems. This allows us to improve approximations to a perturbed dynamics, beyond the standard approximation based on…
We study the adiabatic approximation of the dynamics of a bipartite quantum system with respect to one of the components, when the coupling between its two components is perturbative. We show that the density matrix of the considered…
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…
This paper shows that WKB wave function can be expressed in the form of an adiabatic expansion. To build a bridge between two widely invoked approximation schemes seems pedagogically instructive. Further "cubic-WKB" method that has been…
Quantum adiabatic evolution, an important fundamental concept inphysics, describes the dynamical evolution arbitrarily close to the instantaneous eigenstate of a slowly driven Hamiltonian. In most systems undergoing spontaneous…
One of the difficulties in adiabatic quantum computation is the limit on the computation time. Here we propose two schemes to speed-up the adiabatic evolution. To apply this controlled adiabatic evolution to adiabatic quantum computation,…
In this paper, we present an invariant perturbation theory of the adiabatic process based on the concepts of U(1)-invariant adiabatic orbit and U(1)-invariant adiabatic expansion. As its application, we propose and discuss new adiabatic…
We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…
Quantum information processing offers dramatic speedups, yet is famously susceptible to decoherence, the process whereby quantum superpositions decay into mutually exclusive classical alternatives, thus robbing quantum computers of their…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…