Related papers: Adiabatic Product Expansion
A general quantum adiabatic theorem with and without the time-dependent orthogonalization is proven, which can be applied to understand the origin of activation energies in chemical reactions. Further proofs are also developed for the…
Adiabatic evolution is an emergent design principle for time modulated metamaterials, often inspired by insights from topological quantum computing such as braiding operations. However, the pursuit of classical adiabatic metamaterials is…
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 present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
In this paper the evolution of a quantum system drived by a non-Hermitian Hamiltonian depending on slowly-changing parameters is studied by building an universal high-order adiabatic approximation(HOAA) method with Berry's phase ,which is…
We present numerical calculations, and simulations performed on a Rydberg atom quantum simulator, of the adiabatic evolution of many-body quantum systems around a quantum phase transition. We demonstrate that the end-to-end transfer error,…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
The Constrained Adiabatic Trajectory Method (CATM) is reexamined as an integrator for the Schr\"odinger equation. An initial discussion places the CATM in the context of the different integrators used in the literature for time-independent…
The adiabatic approximation exhibits wide applicability in quantum mechanics, providing a simple approach for nontransitional dynamics in quantum systems governed by slowly varying time-dependent Hamiltonians. However, the standard…
In a quantum system initially in the n-th eigenstate, an adiabatic evolution of the Hamiltonian ensures that the system remains in the corresponding instantaneous eigenstate while acquiring a phase factor. This phase has two components: one…
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,…
We introduce a general framework for deriving effective dynamics from arbitrary time-dependent generators, based on a systematic operator cumulant expansion. Unlike traditional approaches, which typically assume periodic or adiabatic…
For quantum effects $a$ and $b$ we define the $a$-evolution of $b$ at time $t$ denoted by $b(t\mid a)$. We interpret $b(t\mid a)$ as the influence that $a$ has on $b$ at time $t$ when $a$ occurs, but is not measured at time $t=0$. Using…
In this paper we study the evolution operator of a time-dependent Hamiltonian in the three level system. The evolution operator is based on $SU(3)$ and its dimension is $8$, so we obtain three complex Riccati differential equations…
We present a general method for studying coupled qubits driven by adiabatically changing external parameters. Extended calculations are provided for a two-bit Hamiltonian whose eigenstates can be used as logical states for a quantum CNOT…
We apply the method of shortcuts to adiabaticity to nonequilibrium systems. For unitary dynamics, the system Hamiltonian is separated into two parts. One of them defines the adiabatic states for the state to follow and the nonadiabatic…
Big Data is characterized by Volume, Velocity, Veracity and Complexity. The interaction between this huge data is complex with an associated free will having dynamic and non linear nature. We reduced big data based on its characteristics,…
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…
Both unitary evolution and the effects of dissipation and decoherence for a general three-level system are of widespread interest in quantum optics, molecular physics, and elsewhere. A previous paper presented a technique for solving the…
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…