Related papers: General conditions for a quantum adiabatic evoluti…
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…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
We investigate the adiabatic orbital evolution of a point particle in the Kerr spacetime due to the emission of gravitational waves. In the case that the timescale of the orbital evolution is enough smaller than the typical timescale of…
An adiabatic change of parameters along a closed path may interchange the (quasi-)eigenenergies and eigenspaces of a closed quantum system. Such discrepancies induced by adiabatic cycles are refereed to as the exotic quantum holonomy, which…
Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and…
It is a fundamental problem to characterize the nonequilibrium processes. For a slowly moving one-dimensional potential, we explore the quasi adiabatic dynamics of the initial energy eigenstates for a confined quantum system interacting…
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$.…
Shortcuts to adiabaticity provide a general approach to mimic adiabatic quantum processes via arbitrarily fast evolutions in Hilbert space. For these counter-diabatic evolutions, higher speed comes at higher energy cost. Here, the…
A typical goal of a quantum simulation is to find the energy levels and eigenstates of a given Hamiltonian. This can be realized by adiabatically varying the system control parameters to steer an initial eigenstate into the eigenstate of…
Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as…
In this paper, decoherence is studied for quantum systems undergoing adiabatic processes, which are coupled to huge quantum environments. It is shown that decoherence can happen with respect to a preferred basis given by transient…
Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing…
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…
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.
The property of adiabatic invariance is studied for the generalized potential satisfying the condition of identity of sphere's and point mass's gravity. That function contains a second term corresponding to the cosmological constant as…
We discuss the basic theoretical framework for non-Hermitian quantum systems with particular emphasis on the diagonalizability of non-Hermitian Hamiltonians and their $GL(1,\mathbb{C})$ gauge freedom, which are relevant to the adiabatic…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
Quantum annealers play a major role in the ongoing development of quantum information processing and in the advent of quantum technologies. Their functioning is underpinned by the many-body adiabatic evolution connecting the ground state of…
It is generally believed that a generic system can be reversibly transformed from one state into another by sufficiently slow change of parameters. A standard argument favoring this assertion is based on a possibility to expand the energy…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…