Related papers: Adiabatic approximation with exponential accuracy …
We formulate an adiabatic theorem adapted to models that present an instantaneous eigenvalue experiencing an infinite number of crossings with the rest of the spectrum. We give an upper bound on the leading correction terms with respect to…
Let $H(t)=(1-t/T)H_0 + (t/T)H_1$, $t\in [0,T]$, be the Hamiltonian governing an adiabatic quantum algorithm, where $H_0$ is diagonal in the Hadamard basis and $H_1$ is diagonal in the computational basis. We prove that $H_0$ and $H_1$ must…
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing…
The system undergoes adiabatic evolution when its population in the instantaneous eigenbasis of its time-dependent Hamiltonian changes only negligibly. Realization of such dynamics requires slow-enough changes of the parameters of the…
We explore the relationship between two figures of merit for an adiabatic quantum computation process: the success probability $P$ and the minimum gap $\Delta_{min}$ between the ground and first excited states, investigating to what extent…
Quantum adiabatic processes -that keep constant the populations in the instantaneous eigenbasis of a time-dependent Hamiltonian- are very useful to prepare and manipulate states, but take typically a long time. This is often problematic…
We study feedback control of classical Hamiltonian systems with the controlling parameter varying slowly in time. The control aims to change system's energy. We show that the control problems can be solved with help of an adiabatic…
Obtaining adiabatic processes that connect equilibrium states in a given time represents a challenge for mesoscopic systems. In this paper, we explicitly show how to build these finite-time adiabatic processes for an overdamped Brownian…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
An explicit proof is developed to reinforce the accuracy of the quantum adiabatic theorem in its original form without any inconsistency and/or violation. Based on this proof, we discuss physical implications that give rise to the violation…
We review the quantum adiabatic approximation for closed systems, and its recently introduced generalization to open systems (M.S. Sarandy and D.A. Lidar, e-print quant-ph/0404147). We also critically examine a recent argument claiming that…
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…
Adiabatic evolution is a central paradigm in quantum physics. Digital simulations of adiabatic processes are generally viewed as costly, since algorithmic errors typically accumulate over the long evolution time, requiring exceptionally…
Motivated by the quantum adiabatic algorithm (QAA), we consider the scaling of the Hamiltonian gap at quantum first order transitions, generally expected to be exponentially small in the size of the system. However, we show that a quantum…
Adiabatic gauge potential is the origin of nonadiabatic transitions. In counterdiabatic driving, which is a method of shortcuts to adiabaticity, adiabatic gauge potential can be used to realize identical dynamics to adiabatic time evolution…
We study the adiabatic limit in the density matrix approach for a quantum system coupled to a weakly dissipative medium. The energy spectrum of the quantum model is supposed to be non-degenerate. In the absence of dissipation, the geometric…
Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…
For slow--fast quantum systems, we compute first corrections to the quantum action and to the effective slow Hamiltonian.
Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed…
The strategy of shortcuts to adiabaticity enables us to realize adiabatic dynamics in finite time. In the counter-diabatic driving approach, an auxiliary Hamiltonian which is called the counter-diabatic Hamiltonian is appended to an…