Quantum simulations of classical annealing processes.
We describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution randomization. It requires order 1/sqrt delta steps to find an optimal solution with bounded error probability, where delta is the minimum spectral gap of the stochastic matrices used in the classical annealing process. This is a quadratic improvement over the order 1/delta steps required by the latter.
Somma
R D
RD
Perimeter Institute for Theoretical Physics, Waterloo, ON N2L 2Y5, Canada. rsomma@perimeterinstitute.ca
Boixo
S
S
Barnum
H
H
Knill
E
E
D000465:Algorithms; D019295:Computational Biology; D003198:Computer Simulation; D008956:Models, Chemical; D011789:Quantum Theory