Related papers: How fast and robust is the quantum adiabatic passa…
The quantum adiabatic unstructured search algorithm is one of only a handful of quantum adiabatic optimization algorithms to exhibit provable speedups over their classical counterparts. With no fault tolerance theorems to guarantee the…
Quantum batteries are energy storage devices that satisfy quantum mechanical principles. How to improve the battery's performance such as stored energy and power is a crucial element in the quantum battery. Here, we investigate the charging…
We use the dynamical invariants associated with the Hamiltonian of an atom in a one dimensional moving trap to inverse engineer the trap motion and perform fast atomic transport without final vibrational heating. The atom is driven…
Nonstoquastic Hamiltonians are hard to simulate due to the sign problem in quantum Monte Carlo simulation. It is however unclear whether nonstoquasticity can lead to advantage in quantum annealing. Here we show that YY-interaction between…
The adiabatic motion of a charged, spinning, quantum particle in a two - dimensional magnetic field is studied. A suitable set of operators generalizing the cinematical momenta and the guiding center operators of a particle moving in a…
We discuss applications of shortcuts to adiabaticity (STA) to adiabatic quantum computation. After reviewing the fundamental properties and the present status of STA from the author's personal point of view, we apply the method to the…
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to…
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.…
Hamiltonian simulations are key subroutines in adiabatic quantum computation, quantum control, and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. In contrast to time-independent Hamiltonian…
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic…
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…
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…
Recently, the quantum brachistochrone problem is discussed in the literature by using non-Hermitian Hamilton operators of different type. Here, it is demonstrated that the passage time is tunable in realistic open quantum systems due to the…
The basic adiabatic theorems of classical and quantum mechanics are over-viewed and an adiabatic theorem in quantum mechanics without a gap condition is described.
The nonadiabatic dynamics of a many-body system driven through a quantum critical point can be controlled using counterdiabatic driving, where the formation of excitations is suppressed by assisting the dynamics with auxiliary multiple-body…
We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a…
Nonadiabatic holonomic quantum computation has received increasing attention due to the merits of both robustness against control errors and high-speed implementation. A crucial step in realizing nonadiabatic holonomic quantum computation…
Adiabatic quantum state evolution can be accelerated through a variety of shortcuts to adiabaticity. In one approach, a counterdiabatic quantum Hamiltonian $\hat H_{CD}$ is constructed to suppress nonadiabatic excitations. In the analogous…
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…
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…