Related papers: Geometric quantum adiabatic methods for quantum ch…
Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been…
Fixed-point quantum search algorithms succeed at finding one of $M$ target items among $N$ total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…
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…
We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…
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…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
Nonadiabatic holonomic quantum gates are high-speed and robust. Nevertheless, they were found to be more fragile than the adiabatic gates when systematic errors become dominant. Inspired by the dark-path scheme that was used to partially…
The quantum adiabatic theorem is fundamental to time dependent quantum systems, but being able to characterize quantitatively an adiabatic evolution in many-body systems can be a challenge. This work demonstrates that the use of appropriate…
According to the adiabatic theorem of quantum mechanics, a system initially in the ground state of a Hamiltonian remains in the ground state if one slowly changes the Hamiltonian. This can be used in principle to solve hard problems on…
Geometric quantum computation relies on the geometric phase that arises in adiabatic cyclic evolutions of non-degenerate quantum systems, enabling the design of robust quantum gates. However, the adiabatic condition requires long evolution…
A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the…
We present the formulation of the problem of the coherent dynamics of quantum mechanical two-level systems in the adiabatic region in terms of the differential geometry of plane curves. We show that there is a natural plane curve…
Quasi-degenerate eigenvalue problems are central to quantum chemistry and condensed-matter physics, where low-energy spectra often form manifolds of nearly degenerate states that determine physical properties. Standard quantum algorithms,…
Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialised state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible.…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
The operation of near-term quantum technologies requires the development of feasible, implementable, and robust strategies of controlling complex many body systems. To this end, a variety of techniques, so-called "shortcuts to adiabaticty",…
A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is…
Different techniques to speed up quantum adiabatic processes are currently being explored for applications in atomic, molecular and optical physics, such as transport, cooling and expansions, wavepacket splitting, or internal state control.…
We extend the global randomized error cancellation (GREC) method for quantum error mitigation (QEM) in an application to adiabatic evolution of states on a noisy quantum device. We apply the adiabatic GREC method to the evolution of…