Related papers: How fast and robust is the quantum adiabatic passa…
There are a number of tasks in quantum information science that exploit non-transitional adiabatic dynamics. Such a dynamics is bounded by the adiabatic theorem, which naturally imposes a speed limit in the evolution of quantum systems.…
The superadiabatic quantum driving, producing a perfect adiabatic transfer on a given Hamitonian by introducing an additional Hamiltonian, is theoretically analysed for transfers within a three-level system. Our starting point is the…
Starting with the quantum brachistochrone problem of the infinitesimal form, we solve the minimal time and corresponding time-dependent Hamiltonian to drive a pure quantum state with limited resources along arbitrary pre-assigned…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
The dynamics of a quantum phase transition is inextricably woven with the formation of excitations, as a result of the critical slowing down in the neighborhood of the critical point. We design a transitionless quantum driving through a…
We propose a method to produce fast transitionless dynamics for finite-dimensional quantum systems without requiring additional Hamiltonian components not included in the initial control setup, remaining close to the true adiabatic path at…
The quantum brachistochrone problem addresses the fundamental challenge of achieving the quantum speed limit in applications aiming to realize a given unitary operation in a quantum system. Specifically, it looks into optimization of the…
The quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to find the minimum of a classical cost function whose domain has size N. We show that poor choices for the Hamiltonian can guarantee that the algorithm will…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…
Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization. We introduce a transformation that…
We use the approach of "transitionless quantum driving" proposed by Berry to construct shortcuts to the population transfer and the creation of maximal entanglement between two $\Lambda $-type atoms based on the cavity quantum electronic…
The quantum adiabatic theorem states that if a quantum system starts in an eigenstate of the Hamiltonian, and this Hamiltonian varies sufficiently slowly, the system stays in this eigenstate. We investigate experimentally the conditions…
The system undergoes adiabatic evolution when its population in the instantaneous eigenbasis of its time-dependent Hamiltonian changes only negligibly. Realization of such dynamics requires slow-enough changes of the parameters of the…
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 analyze the problem of optimal adiabatic passage through a quantum critical point. We show that to minimize the number of defects the tuning parameter should be changed as a power-law in time. The optimal power is proportional to the…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
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…
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…
Keeping a quantum system in a given instantaneous eigenstate is a control problem with numerous applications, e.g., in quantum information processing. The problem is even more challenging in the setting of open quantum systems, where…
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…