Related papers: Projection based adiabatic elimination of bipartit…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
In multi-level systems, the commonly used adiabatic elimination is a method for approximating the dynamics of the system by eliminating irrelevant, non-resonantly coupled levels. This procedure is, however, somewhat ambiguous and it is not…
The method of adiabatic elimination has been widely adopted in quantum optics in the past several decades. In the study of cavity-based light-matter interactions, the bad-cavity limit is often encountered, where the damping rate of the…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
We investigate the adiabatic elimination of fast variables in relativistic stochastic mechanics, which is analyzed by using the equation of motion and the distribution function, with relativistic corrections explicitly derived. A new…
We introduce a self-consistent framework for the analysis of both Abelian and non-Abelian geometric phases associated with open quantum systems, undergoing cyclic adiabatic evolution. We derive a general expression for geometric phases,…
We propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm…
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…
We propose a method to adiabatically control an atomic ensemble using a decoherence-free subspace (DFS) within a dissipative cavity. We can engineer a specific eigenstate of the system's Lindblad jump operators by injecting a field into the…
An important class of physical systems that are of interest in practice are input-output open quantum systems that can be described by quantum stochastic differential equations and defined on an infinite-dimensional underlying Hilbert…
The adiabatic theorem is an important concept in quantum mechanics, it tells that a quantum system subjected to gradually changing external conditions remains to the same instantaneous eigenstate of its Hamiltonian as it initially in. In…
Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition…
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…
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…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
In the conventional quantum mechanics (i.e., hermitian QM) the adia- batic theorem for systems subjected to time periodic fields holds only for bound systems and not for open ones (where ionization and dissociation take place) [D. W. Hone,…
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential…
Spin-squeezed states are metrologically useful quantum states where entanglement allows for enhanced sensing with respect to the standard quantum limit. Key challenges include the efficient preparation of spin-squeezed states and the…
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is…