Related papers: Shortcuts to adiabaticity
Shortcuts to adiabaticity is a general method for speeding up adiabatic quantum protocols, and has many potential applications in quantum information processing. Unfortunately, analytically constructing shortcuts to adiabaticity for systems…
We present a new technique for efficiently transitioning a quantum system from an initial to a final stationary state in less time than is required by an adiabatic (quasi-static) process. Our approach makes use of Nelson's stochastic…
Tremendous research efforts have been invested in exploring and designing so-called shortcuts to adiabaticity. These are finite-time processes that produce the same final states that would result from infinitely slow driving. Most of these…
The adiabatic approximation exhibits wide applicability in quantum mechanics, providing a simple approach for nontransitional dynamics in quantum systems governed by slowly varying time-dependent Hamiltonians. However, the standard…
Topological quantum information processing relies on adiabatic braiding of nonabelian quasiparticles. Performing the braiding operations in finite time introduces transitions out of the ground-state manifold and deviations from the…
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…
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…
Fast and robust quantum control protocols are often based on an idealised approximate description of the relevant quantum system. While this may provide a performance which is close to optimal, improvements can be made by incorporating…
In noisy quantum systems, achieving high-fidelity state preparation using the adiabatic approach faces a dilemma: either extending the evolution time to reduce diabatic transitions or shortening it to mitigate decoherence effects. Here, we…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Shortcuts to adiabaticity are strategies for conserving adiabatic invariants under non-adiabatic (i.e. fast-driving) conditions. Here, we show how to extend classical, Hamiltonian shortcuts to adiabaticity to allow the crossing of a…
We propose a method to transfer the population and control the state of two-level and three-level atoms speeding-up Adiabatic Passage techniques while keeping their robustness versus parameter variations. The method is based on…
We review a scheme for the systematic design of quantum control protocols based on shortcuts to adiabaticity in few-level quantum systems. The adiabatic dynamics is accelerated by introducing high-frequency modulations in the control…
The adiabatic theorem and "shortcuts to adiabaticity" for the adiabatic dynamics of time-dependent decoherence-free subspaces are explored in this paper. Starting from the definition of the dynamical stable decoherence-free subspaces, we…
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 need for fast and robust quantum state transfer is an essential element in scalable quantum information processing, leading to widespread interest in shortcuts to adiabaticity for speeding up adiabatic quantum protocols. However,…
Rapid and efficient preparation, manipulation and transfer of quantum states through an array of quantum dots (QDs) is a demanding requisite task for quantum information processing and quantum computation in solid-state physics.…
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…