Optimization through quantum annealing: theory and some applications
Quantum annealing is a promising tool for solving optimization problems, similar in some ways to the traditional (classical) simulated annealing of Kirkpatrick et al. Simulated annealing takes advantage of thermal fluctuations in order to explore the optimization landscape of the problem at hand, whereas quantum annealing employs quantum fluctuations. Intriguingly, quantum annealing has been proved to be more effective than its classical counterpart in many applications. We illustrate the theory and the practical implementation of both classical and quantum annealing-highlighting the crucial differences between these two methods-by means of results recently obtained in experiments, in simple toy-models, and more challenging combinatorial optimization problems (namely, Random Ising model and Travelling Salesman Problem). The techniques used to implement quantum and classical annealing are either deterministic evolutions, for the simplest models, or Monte Carlo approaches, for harder optimization tasks. We discuss the pro and cons of these approaches and their possible connections to the landscape of the problem addressed.
Document Type: Research Article
Affiliations: International School for Advanced Studies (SISSA), via Beirut 2–4, I-34014, Trieste, Italy, and INFM Democritos National Simulation Center, via Beirut 2–4, I-34014, Trieste, Italy
Publication date: 2006-07-01