Related papers: Nonadiabatic holonomic quantum computation based o…
We introduce an operational framework to analyze non-adiabatic Abelian and non-Abelian, cyclic and non-cyclic, geometric phases in open quantum systems. In order to remove the adiabaticity condition, we generalize the theory of dynamical…
High control in the preparation and manipulation of states is an experimental and theoretical important task in many quantum protocols. Shortcuts to adiabaticity methods allow to obtain desirable states of a adiabatic dynamics but in short…
The quantum speed limit specifies a universal bound of the fidelity between the initial state and the time-evolved state. We apply this method to find a bound of the fidelity between the adiabatic state and the time-evolved state. The bound…
The theoretical investigation of non-adiabatic processes is hampered by the complexity of the coupled electron-nuclear dynamics beyond the Born-Oppenheimer approximation. Classically, the simulation of such reactions is limited by the…
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…
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…
Nontrivial spectral properties of non-Hermitian systems can give rise to intriguing effects that lack counterparts in Hermitian systems. For instance, when dynamically varying system parameters along a path enclosing an exceptional point…
We propose a protocol for bosonic binomial-code nonadiabatic holonomic quantum computation in a system composed of an artificial atom ultrastrongly coupled to a cavity resonator. In our protocol, the binomial codes, formed by superpositions…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
Topological quantum computation has been extensively studied due to its robustness against decoherence. A conventional way to realize it is by adiabatic operations---it requires relatively long time to accomplish so that the speed of…
We provide a general formula of quantum transfer that includes the non-adiabatic effect under periodic environmental modulation by using full counting statistics in Hilbert-Schmidt space. Applying the formula to an anharmonic junction model…
Adiabatic protocols are employed across a variety of quantum technologies, from implementing state preparation and individual operations that are building blocks of larger devices, to higher-level protocols in quantum annealing and…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric…
Adiabatic quantum control is a very important approach for quantum physics and quantum information processing. It holds the advantage with robustness to experimental imperfections but accumulates more decoherence due to the long evolution…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We present a general approach to speed up the adiabatic process without adding the traditional counterdiabatic driving (CD) Hamiltonian. The strategy is to design an easy-to-get intermediate Hamiltonian to connect the original Hamiltonian…
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, $H_{\rm p}$, is normally chosen to be diagonal in the…
Open quantum systems described by a non-Hermitian Hamiltonian exhibit rich dynamics due to the topology of their complex energy spectrum. By encircling an exceptional point degeneracy, this topology allows for topological state transport,…
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…