Related papers: The relationship between minimum gap and success p…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
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…
In the context of adiabatic quantum computation (AQC), it has been argued that first-order quantum phase transitions (QPTs) due to localisation phenomena cause AQC to fail by exponentially decreasing the minimal spectral gap of the…
We investigate the efficiency of Quantum Adiabatic Optimization when overcoming potential barriers to get from a local to a global minimum. Specifically we look at n qubit systems with symmetric cost functions f:{0, 1}^n->R where the ground…
We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state.…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
Understanding NP-complete problems is a central topic in computer science. This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer.…
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.
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…
A gapped quantum system that is adiabatically perturbed remains approximately in its eigenstate after the evolution. We prove that, for constant gap, general quantum processes that approximately prepare the final eigenstate require a…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization. We introduce a transformation that…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…
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…
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,…
We show that adiabatic evolution of a low-dimensional lattice of quantum spins with a spectral gap can be simulated efficiently. In particular, we show that as long as the spectral gap \Delta E between the ground state and the first excited…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…