Related papers: Time-resolved tomography of a driven adiabatic qua…
Adiabatic process has found many important applications in modern physics, the distinct merit of which is that it does not need accurate control over the timing of the process. However, it is a slow process, which limits the application in…
We propose an experimental method for evaluating the adiabatic condition during quantum annealing (QA), which will be essential for solving practical problems. The adiabatic condition consists of the transition matrix element and the energy…
Adiabaticity occurs when, during its evolution, a physical system remains in the instantaneous eigenstate of the hamiltonian. Unfortunately, existing results, such as the quantum adiabatic theorem based on a slow down evolution (H(epsilon…
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement…
Characterizing quantum many-body systems is a fundamental problem across physics, chemistry, and materials science. While significant progress has been made, many existing Hamiltonian learning protocols demand digital quantum control over…
We study feedback control of classical Hamiltonian systems with the controlling parameter varying slowly in time. The control aims to change system's energy. We show that the control problems can be solved with help of an adiabatic…
Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…
The reversible nature of thermodynamical cycles is an idealisation based on the assumption of perfect quasi-static dynamics. As a consequence of this assumption, ideal engines operate at the maximum efficiency but have zero power. Realistic…
We propose an efficient strategy to find optimal control functions for state-to-state quantum control problems. Our procedure first chooses an input state trajectory, that can realize the desired transformation by adiabatic variation of the…
The ability to accurately control a quantum system is a fundamental requirement in many areas of modern science such as quantum information processing and the coherent manipulation of molecular systems. It is usually necessary to realize…
A shortcut to adiabaticity (STA) is concerned with the fast and robust manipulation of the dynamics of a quantum system that reproduces the effect of an adiabatic process. A recently proposed method enables the generation of shortcuts from…
Adiabatic elimination is a perturbative model reduction technique based on timescale separation and often used to simplify the description of composite quantum systems. We here analyze a quantum experiment where the perturbative expansion…
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…
We present an approach for carrying out non-adiabatic molecular dynamics simulations of systems in which non-adiabatic transitions arise from the coupling between the classical atomic motions and a quasi-continuum of electronic quantum…
We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…
We investigate the connection between local minima in the problem Hamiltonian and first order quantum phase transitions during an adiabatic quantum computation. We demonstrate how some properties of the local minima can lead to an extremely…
Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
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…