Related papers: Adiabatic Quantum Transistors
Many areas of physics rely upon adiabatic state transfer protocols, allowing a quantum state to be moved between different physical systems for storage and retrieval or state manipulation. However, these state-transfer protocols suffer from…
We illustrate the adiabatic quantum computing solution of the knapsack problem with both integer profits and weights. For problems with $n$ objects (or items) and integer capacity $c$, we give specific examples using both an Ising class…
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…
We show that current noisy quantum computers are ideal platforms for the simulation of quantum many-body dynamics in generic open systems. We demonstrate this using the IBM Quantum Computer as an experimental platform for confirming the…
An elementary excitation in an aggregate of coupled particles generates a collective excited state. We show that the dynamics of these excitations can be controlled by applying a transient external potential which modifies the phase of the…
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…
Feedback in compound quantum systems is effected by using the output from one sub-system (``the system'') to control the evolution of a second sub-system (``the ancilla'') which is reversibly coupled to the system. In the limit where the…
We propose a nonadiabatic approach to quantum annealing, in which we repeat quantum annealing in nonadiabatic time scales, and collect the final states of many realizations to find the ground state among them. In this way, we replace the…
Transporting quantum information is an important prerequisite for quantum computers. We study how this can be done in Heisenberg-coupled spin networks using adiabatic control over the coupling strengths. We find that qudits can be…
With the advent of quantum technologies comes the requirement of building quantum components able to store energy to be used whenever necessary, i.e. quantum batteries. In this paper we exploit an adiabatic protocol to ensure a stable…
We reveal universal dynamical scaling behavior across adiabatic quantum phase transitions (QPTs) in networks ranging from traditional spatial systems (Ising model) to fully connected ones (Dicke and Lipkin-Meshkov-Glick models). Our…
Coherent population transfer by adiabatic passage is a well-known method in quantum optics. This remarkable technique which is based on simple ideas has remained largely unknown to solid-state physicists. Here we provide an introduction to…
Quantum simulation provides a powerful route for exploring many-body phenomena beyond the capabilities of classical computation. Existing approaches typically proceed in the forward direction: a model Hamiltonian is specified, implemented…
We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state.…
In many quantum technologies adiabatic processes are used for coherent quantum state operations, offering inherent robustness to errors in the control parameters. The main limitation is the long operation time resulting from the requirement…
Shortcut to adiabaticity in various quantum systems has attracted much attention with the wide applications in quantum information processing and quantum control. In this paper, we concentrate on stimulated Raman shortcut-to-adiabatic…
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…
The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle of quantum annealing, which implies that a carefully controlled energy solution is optimal and…
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…
A new simple proof of the adiabatic theorem is given in the finite dimensional case for nondegenerate as well as degenerate states. The explicitly integrable two level system is considered as an example. It is demonstrated that the error…