Quantum simulated annealing

ORAL

Abstract

We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks and quantum phase estimation, and can be viewed as the quantum analogue of the discrete-time Markov Chain Monte Carlo implementation of classical simulated annealing.

–

Authors

  • Sergio Boixo

    University of New Mexico, UNM

  • Rolando Somma

    Perimiter Institute

  • Howard Barnum

    Los Alamos National Laboratory, LANL, Los Alamos National Laboratory and GSCCM Chair