Related papers: The adiabatic theorem in the presence of noise
Transition amplitudes between instantaneous eigenstates of quantum two-level system are evaluated analytically on the basis of a new parametrization of its evolution operator, which has recently been proposed to construct exact solutions.…
The design of quantum control methods has been shown to greatly improve the performance of many evolving quantum technologies. To this end, the usage of adiabatic dynamics to drive quantum systems is seriously limited by the action of…
The preparation of a given quantum state on a quantum computing register is a typically demanding operation, requiring a number of elementary gates that scales exponentially with the size of the problem. Using the adiabatic theorem for…
We consider a time-dependent small quantum system weakly coupled to an environnement, whose effective dynamics we address by means of a Lindblad equation. We assume the Hamiltonian part of the Lindbladian is slowly varying in time and the…
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…
A quantum system interacting with its environment is subject to dephasing which ultimately destroys the information it holds. Using a superconducting qubit, we experimentally show that this dephasing has both dynamic and geometric origins.…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
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 consider the electrons of a molecule in the adiabatic time-dependent density functional theory approximation. We establish the well-posedness of the time evolution and its linear response close to a non-degenerate ground state, and prove…
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…
We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bath and in the presence of a time-dependent Hamiltonian. The merit of these models is that they can be solved exactly, and will help us to…
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
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…
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…
We prove a robust extension of the quantum adiabatic theorem. The theorem applies to systems that have resonances instead of bound states, and to systems for which just an approximation to a bound state is known. To demonstrate the…
The formalism to treat quantization and evolution of cosmological perturbations of multiple fluids is described. We first construct the Lagrangian for both the gravitational and matter parts, providing the necessary relevant variables and…
Unwanted interaction between a quantum system and its fluctuating environment leads to decoherence and is the primary obstacle to establishing a scalable quantum information processing architecture. Strategies such as environmental and…
Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…
Recently there have been some controversies about the criterion of the adiabatic approximation. It is shown that an approximate diagonalization of the effective Hamiltonian in the second quantized formulation gives rise to a reliable and…
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,…