Related papers: Speedup of the Quantum Adiabatic Algorithm using D…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
Quantum adiabatic transfer is widely used in quantum computation and quantum simulation. However, the transfer speed is limited by the quantum adiabatic approximation condition, which hinders its application in quantum systems with a short…
Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers…
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…
We present a method for accelerating adiabatic protocols for systems involving a coupling to a continuum, one that cancels both non-adiabatic errors as well as errors due to dissipation. We focus on applications to a generic quantum state…
The design of quantum control methods has been shown to greatly improve the performance of many evolving quantum technologies. To this end, the usage of adiabatic dynamics to drive quantum systems is seriously limited by the action of…
For adiabatic controls of quantum systems, the non-adiabatic transitions are reduced by increasing the operation time of processes. Perfect quantum adiabaticity usually requires the infinitely slow variation of control parameters. In this…
It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic…
A quadratic speedup of the quantum adiabatic algorithm (QAA) for finding independent sets (ISs) in a graph is proven analytically. In comparison to the best classical algorithm with $O(n^2)$ scaling, where $n$ is the number of vertexes, our…
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…
Quantum phase transitions materialize as level crossings in the ground-state energy when the parameters of the Hamiltonian are varied. The resulting ground-state phase diagrams are straightforward to determine by exact diagonalization on…
Boltzmann sampling is a central component of many computational frameworks, including numerous algorithms in machine learning. Although quantum annealers have been investigated as potential fast Boltzmann samplers, their dependence on…
Quantum computation promises to provide substantial speedups in many practical applications with a particularly exciting one being the simulation of quantum many-body systems. Adiabatic state preparation (ASP) is one way that quantum…
Quantum information processing requires fast manipulations of quantum systems in order to overcome dissipative effects. We propose a method to accelerate quantum dynamics and obtain a target state in a shorter time relative to unmodified…
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…
We propose applying the adiabatic algorithm to prepare high-energy eigenstates of integrable models on a quantum computer. We first review the standard adiabatic algorithm to prepare ground states in each magnetization sector of the…
What are the conditions for adiabatic quantum computation (AQC) to outperform classical computation? Although there exist several quantum adiabatic algorithms achieving the strong quantum speedup, the essential keys to their speedups are…
An energy gap develops near quantum critical point of quantum phase transition in a finite many-body (MB) system, facilitating the ground state transformation by adiabatic parameter change. In real application scenarios, however, the…
Recently, a new method, which can significantly speed up adiabatic quantum state transfer by using dressed states, was proposed by Baksic \emph{et~al.} [Phys. Rev. Lett. \textbf{116}, 230503 (2016)]. Assisted by quantum Zeno dynamics, we…
Local counterdiabatic driving is a method of improving the performance of adiabatic control and digital implementation of quantum annealing with local counterdiabatic driving has been discussed. In this paper, we propose a decomposition…