2000 character limit reached
Quantum algorithms for simulated annealing (1512.03806v2)
Published 11 Dec 2015 in quant-ph
Abstract: This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales with the inverse square root of the spectral gap of an associated stochastic matrix. This represents a quadratic quantum speedup, in terms of the gap, with respect to classical simulated annealing.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.