Optimization by quantum annealing: Lessons from hard satisfiability problems

Demian A. Battaglia, Giuseppe E. Santoro, and Erio Tosatti
Phys. Rev. E 71, 066707 – Published 29 June 2005

Abstract

The path integral Monte Carlo simulated quantum annealing algorithm is applied to the optimization of a large hard instance of the random satisfiability problem (N=10000). The dynamical behavior of the quantum and the classical annealing are compared, showing important qualitative differences in the way of exploring the complex energy landscape of the combinatorial optimization problem. At variance with the results obtained for the Ising spin glass and for the traveling salesman problem, in the present case the linear-schedule quantum annealing performance is definitely worse than classical annealing. Nevertheless, a quantum cooling protocol based on field-cycling and able to outperform standard classical simulated annealing over short time scales is introduced.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 18 February 2005

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

©2005 American Physical Society

Authors & Affiliations

Demian A. Battaglia1,*, Giuseppe E. Santoro1,2,†, and Erio Tosatti1,2,‡

  • 1International School for Advanced Studies (SISSA), and INFM Democritos National Simulation Center, Via Beirut 2-4, I-34014 Trieste, Italy
  • 2International Center for Theoretical Physics (ICTP), Trieste, Italy

  • *Electronic address: battagli@sissa.it
  • Electronic address: santoro@sissa.it
  • Electronic address: tosatti@sissa.it

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 71, Iss. 6 — June 2005

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
×