The complexity of the Quantum Adiabatic Algorithm

  • Young A
  • Knysh S
  • Smelyanskiy V
  • 14


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


The Quantum Adiabatic Algorithm has been proposed as a general purpose algorithm for solving hard optimization problems on a quantum computer. Early work on very small sizes indicated that the running time (complexity) only increased as a (quite small) power of the problem size N. We report results of Quantum Monte Carlo simulations, using parallel tempering, with which we determine the minimum energy gap (and hence get information the complexity) for much bigger sizes than was possible before. The aim is to see if there is a "crossover" to exponential complexity at large N. We present data for the typical (median) complexity as a function of N, which indicate a crossover to a first order transition at large sizes. This implies that the complexity is exponential at large N, at least for the problem studied. © 2010 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Algorithm
  • Complexity
  • Quantum

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • A. P. Young

  • S. Knysh

  • V. N. Smelyanskiy

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free