We have developed a general technique to study the dynamics of the quantum
adiabatic evolution algorithm applied to random combinatorial optimization
problems in the asymptotic limit of large problem size n. We use as an
example the NP-complete Number Partitioning problem and map the algorithm
dynamics to that of an auxilary quantum spin glass system with the slowly
varying Hamiltonian. We use a Green function method to obtain the adiabatic
eigenstates and the minimum excitation gap, gminβ=O(n2βn/2),
corresponding to the exponential complexity of the algorithm for Number
Partitioning. The key element of the analysis is the conditional energy
distribution computed for the set of all spin configurations generated from a
given (ancestor) configuration by simulteneous fipping of a fixed number of
spins. For the problem in question this distribution is shown to depend on the
ancestor spin configuration only via a certain parameter related to the energy
of the configuration. As the result, the algorithm dynamics can be described in
terms of one-dimenssional quantum diffusion in the energy space. This effect
provides a general limitation on the power of a quantum adiabatic computation
in random optimization problems. Analytical results are in agreement with the
numerical simulation of the algorithm.Comment: 32 pages, 5 figures, 3 Appendices; List of additions compare to v.3:
(i) numerical solution of the stationary Schroedinger equation for the
adiabatic eigenstates and eigenvalues; (ii) connection between the scaling
law of the minimum gap with the problem size and the shape of the
coarse-grained distribution of the adiabatic eigenvalues at the
avoided-crossing poin