Related papers: Improved gap dependence in adiabatic state prepara…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
According to the quantum adiabatic theorem, we can in principle obtain a true vacuum of a quantum system starting from a trivial vacuum of a simple Hamiltonian. In actual adiabatic digital quantum simulation with finite time length and…
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…
Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the…
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…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing…
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.…
We analyze the ground state entanglement in a quantum adiabatic evolution algorithm designed to solve the NP-complete Exact Cover problem. The entropy of entanglement seems to obey linear and universal scaling at the point where the mass…
We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a…
Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and…
We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control…
In a quantum system with a smoothly and slowly varying Hamiltonian, which approaches a constant operator at times $t\to \pm \infty$, the transition probabilities between adiabatic states are exponentially small. They are characterized by an…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
Quantum computing promises significant improvements of computation capabilities in various fields such as machine learning and complex optimization problems. Recent technological advancements suggest that the adiabatic quantum computing…
While it is well-known that every nearly-periodic Hamiltonian system possesses an adiabatic invariant, extant methods for computing terms in the adiabatic invariant series are inefficient. The most popular method involves the heavy…
By stating the adiabatic theorem of quantum mechanics in a clear and rigorous way, we establish a necessary condition and a sufficient condition for its validity, where the latter is obtained employing our recently developed adiabatic…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…
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…