Related papers: Adiabatic quantum unstructured search in parallel
An adiabatic state preparation technique, called the adiabatic spiral, is proposed for the Heisenberg model. This technique is suitable for implementation on a number of quantum simulation platforms such as Rydberg atoms, trapped ions, or…
A universal scheme is introduced to speed up the dynamics of a driven open quantum system along a prescribed trajectory of interest. This framework generalizes counterdiabatic driving to open quantum processes. Shortcuts to adiabaticity…
The Grover algorithm is a crucial solution for addressing unstructured search problems and has emerged as an essential quantum subroutine in various complex algorithms. By using a different approach with previous studies, this research…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…
We present an analog version of the quantum approximate optimization algorithm suitable for current quantum annealers. The central idea of this algorithm is to optimize the schedule function, which defines the adiabatic evolution. It is…
The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…
Adiabatic geometric phase gates offer enhanced robustness against fluctuations compared to con- ventional Rydberg blockade-based phase gates that rely on dynamical phase accumulation. We theoretically demonstrate two- and multi-qubit phase…
We demonstrate provable (sub)exponential quantum speedups in both discrete and continuous optimization, achieved through simple and natural quantum optimization algorithms, namely the quantum adiabatic algorithm for discrete optimization…
A general quantum adiabatic theorem with and without the time-dependent orthogonalization is proven, which can be applied to understand the origin of activation energies in chemical reactions. Further proofs are also developed for the…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
A shortcut-to-adiabatic protocol for the realization of a fast and high-fidelity controlled-phase gate in Rydberg atoms is developed. The adiabatic state transfer, driven in the high-blockade limit, is sped up by compensating nonadiabatic…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
Entangled many-body states are a key resource for quantum technologies. Yet their preparation through analog control of interacting quantum systems is often hindered by experimental imperfections. Here, we introduce the adiabatic echo…
Quantum electrodynamics in 1 + 1D (QED2) shares intriguing properties with QCD, including confinement, string breaking, and interesting phase diagram when the non-trivial topological $\theta$-term is considered. Its lattice regularization…
We investigate the irreconcilability issue that raises in translating the search algorithm from the Continuous-Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along…
Adiabatic elimination is a standard tool in quantum optics, which produces an effective Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher unperturbed energy. It shares with…
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…
We introduce a perturbative approach to solving the time dependent Schroedinger equation, named adiabatic perturbation theory (APT), whose zeroth order term is the quantum adiabatic approximation. The small parameter in the power series…
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a…
In this paper, we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector…