Related papers: Shortcuts to adiabaticity and applications to Quan…
We present a technique that dramatically improves the accuracy of adiabatic state transfer for a broad class of realistic Hamiltonians. For some systems, the total error scaling can be quadratically reduced at a fixed maximum transfer rate.…
We propose analog counterdiabatic quantum computing (ACQC) to tackle combinatorial optimization problems on neutral-atom quantum processors. While these devices allow for the use of hundreds of qubits, adiabatic quantum computing struggles…
The pace and unpredictability of evolution are critically relevant in a variety of modern challenges: combating drug resistance in pathogens and cancer, understanding how species respond to environmental perturbations like climate change,…
Nonadiabatic holonomic quantum computation is a promising approach for implementing quantum gates that offers both efficiency and robustness against certain types of errors. A key element of this approach is a geometric constraint known as…
Reliable quantum information processing requires high-fidelity universal manipulation of quantum systems within the characteristic coherence times. Non-adiabatic holonomic quantum computation offers a promising approach to implement fast,…
We consider a periodically driven system where the high-frequency driving protocol consists of a sequence of potentials switched on and off at different instants within a period. We explore the possibility of introducing an adiabatic…
Adiabatic evolutions find widespread utility in applications to quantum state engineering, geometric quantum computation, and quantum simulation. Although offering robustness to experimental imperfections, adiabatic processes are…
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
We show how one can perform arbitrary rotation of any qubit, using delayed laser pulses through nonadiabatic evolution, i.e., via transitions among the adiabatic states. We use a double-Lambda scheme and use a set of control parameters such…
We describe a many-body quantum system which can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field quantum information is localized on one boundary of the…
In quantum information processing, the development of fast and robust control schemes remains a central challenge. Although quantum adiabatic evolution is inherently robust against control errors, it typically demands long evolution times.…
Quantum adiabatic algorithms are commonly analyzed through local spectral properties of an interpolating Hamiltonian, most notably the minimum energy gap. While this perspective captures an important constraint on adiabatic runtimes, it…
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…
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…
Transitionless quantum driving, also known as counterdiabatic driving, is a unique shortcut technique to adiabaticity, enabling a fast-forward evolution to the same target quantum states as those in the adiabatic case. However, as nothing…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint…
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…
We generalize the adiabatic approximation to the case of open quantum systems, in the joint limit of slow change and weak open system disturbances. We show that the approximation is ``physically reasonable'' as under wide conditions it…