Simulated quantum annealing of double-well and multiwell potentials

E. M. Inack and S. Pilati
Phys. Rev. E 92, 053304 – Published 19 November 2015

Abstract

We analyze the performance of quantum annealing as a heuristic optimization method to find the absolute minimum of various continuous models, including landscapes with only two wells and also models with many competing minima and with disorder. The simulations performed using a projective quantum Monte Carlo (QMC) algorithm are compared with those based on the finite-temperature path-integral QMC technique and with classical annealing. We show that the projective QMC algorithm is more efficient than the finite-temperature QMC technique, and that both are inferior to classical annealing if this is performed with appropriate long-range moves. However, as the difficulty of the optimization problem increases, classical annealing loses efficiency, while the projective QMC algorithm keeps stable performance and is finally the most effective optimization tool. We discuss the implications of our results for the outstanding problem of testing the efficiency of adiabatic quantum computers using stochastic simulations performed on classical computers.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 28 August 2015
  • Revised 15 October 2015

DOI:https://doi.org/10.1103/PhysRevE.92.053304

©2015 American Physical Society

Authors & Affiliations

E. M. Inack1,2 and S. Pilati1

  • 1The Abdus Salam International Centre for Theoretical Physics, I-34151 Trieste, Italy
  • 2SISSA, International School for Advanced Studies and INFN, Sezione di Trieste, I-34136 Trieste, Italy

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 92, Iss. 5 — November 2015

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×