arXiv Analytics

Sign in

arXiv:1709.03971 [quant-ph]AbstractReferencesReviewsResources

Diffusion Monte Carlo Versus Adiabatic Computation for Local Hamiltonians

Jacob Bringewatt, William Dorland, Stephen P. Jordan, Alan Mink

Published 2017-09-12Version 1

Most research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians, whose ground states can be expressed with only real, nonnegative amplitudes. This raises the question of whether classical Monte Carlo algorithms can efficiently simulate quantum adiabatic optimization with stoquastic Hamiltonians. Recent results have given counterexamples in which path integral and diffusion Monte Carlo fail to do so. However, most adiabatic optimization algorithms, such as for solving MAX-k-SAT problems, use k-local Hamiltonians, whereas our previous counterexample for diffusion Monte Carlo involved n-body interactions. Here we present a new 6-local counterexample which demonstrates that even for these local Hamiltonians there are cases where diffusion Monte Carlo cannot efficiently simulate quantum adiabatic optimization. Furthermore, we perform empirical testing of diffusion Monte Carlo on a standard well-studied class of permutation-symmetric tunneling problems and similarly find large advantages for quantum optimization over diffusion Monte Carlo.

Related articles: Most relevant | Search more
arXiv:1006.4958 [quant-ph] (Published 2010-06-25, updated 2010-11-03)
Local Hamiltonians for Maximally Multipartite Entangled States
arXiv:quant-ph/9703022 (Published 1997-03-13)
Reversibility and Adiabatic Computation: Trading Time and Space for Energy
arXiv:1405.5185 [quant-ph] (Published 2014-05-20)
Quantum and Classical in Adiabatic Computation