Quantum Adiabatic Optimization and Combinatorial Landscapes

By: Nasa, National Aeronautics and Space Adm

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.Smelyanskiy, V. N. and Knysh, S. and Morris, R. D.Ames Research CenterALGORITHMS; COMBINATORIAL ANALYSIS; OPTIMIZATION; QUANTUM MECHANICS; ADIABATIC EQUATIONS; TOPOGRAPHY; EIGENVALUES; GRAPH THEORY; HAMILTONIAN FUNCTIONS; ANNEALING; APPROXIMATION; PROBABILITY THEORY

• Format: Paperback
• Language: English
• ISBN: 172374932X
• ISBN13: 9781723749322
• Release Date: January 1
• Publisher: Independently Published
• Length: 30 Pages
• Weight: 0.21 lbs.
• Dimensions: 0.1" x 8.5" x 11.0"