Why adiabatic quantum annealing is unlikely to yield speed-up

Abstract

We study quantum annealing for combinatorial optimization with Hamiltonian $H=z{H}_f+H_0$ where $H_f$ is diagonal, $H_0=-|\varphi ⟩⟨\varphi |$ is the equal superposition state projector and $z$ the annealing parameter. We analytically compute the minimal spectral gap as $\mathcal{O}(1/\sqrt{N})$ with $N$ the total number of states and its location $z_{\ast }$. We show that quantum speed-up requires an annealing schedule which demands a precise knowledge of $z_{\ast }$, which can be computed only if the density of states of the optimization problem is known. However, in general the density of states is intractable to compute, making quadratic speed-up unfeasible for any practical combinatoric optimization problems. We conjecture that it is likely that this negative result also applies for any other instance independent transverse Hamiltonians such as $H_0=-{\sum }_{i=1}^n{\sigma }_i^x$.

23 pages, 6 figures, updated to published version

References in corpus (17)

• Bounds for the adiabatic approximation with applications to quantum computation
• Fixed-point quantum search with an optimal number of queries
• Survey propagation: an algorithm for satisfiability
• How Powerful is Adiabatic Quantum Computation?
• Quantum Adiabatic Brachistochrone
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Size dependence of the minimum excitation gap in the Quantum Adiabatic Algorithm
• The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
• Simple Glass Models and their Quantum Annealing
• Quantum Adiabatic Evolution Algorithms with Different Paths
• Quantum versus classical annealing: insights from scaling theory and results for spin glasses on 3-regular graphs
• 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
• Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
• Effect of Local Minima on Adiabatic Quantum Optimization
• Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
• Fixed-Point Adiabatic Quantum Search
• How Much Structure Is Needed for Huge Quantum Speedups?

Cited by in corpus (2)

• A quantum computing concept for 1-D elastic wave simulation with exponential speedup
• Learning-Driven Annealing with Adaptive Hamiltonian Modification for Solving Large-Scale Problems on Quantum Devices