arXiv:1512.07819 · Journal of Physics Conference Series

Thermal, quantum and simulated quantum annealing: analytical comparisons for simple models

Victor Bapst, Guilhem Semerjian

Published Dec 16, 2013• 12 citations

Abstract

We study various annealing dynamics, both classical and quantum, for simple mean-field models and explain how to describe their behavior in the thermodynamic limit in terms of differential equations. In particular we emphasize the differences between quantum annealing (i.e. evolution with Schrödinger equation) and simulated quantum annealing (i.e. annealing of a Quantum Monte Carlo simulation).

DOI: 10.1088/1742-6596/473/1/012011

Related papers

Optimization through quantum annealing: theory and some applications

Demian A. Battaglia, Lorenzo Stella

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.

Contemporary PhysicsJul 1, 20068 citations

Mathematical foundation of quantum annealing

Satoshi Morita, Hidetoshi Nishimori

Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schrödinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schrödinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.

arXiv:0806.1859Journal of Mathematical PhysicsDec 1, 2008380 citations

Mathematical aspects of quantum annealing

Hidetoshi Nishimori, Satoshi Morita

Sufficient conditions for convergence of quantum annealing are derived for optimization problems represented by the Ising model. Three different types of time evolution are considered; the real-time Schrödinger equation, the path-integral Monte Carlo method and the Green's function Monte Carlo method. It is proved that the system under each dynamics reaches the target solution in the limit of infinite time if the transverse field, representing the strength of quantum fluctuations, decreases inversely proportionally to the power of time in the asymptotic region.

Journal of Physics Conference SeriesJan 1, 20080 citations

Convergence of Quantum Annealing with Real-Time Schrödinger Dynamics

Satoshi Morita, Hidetoshi Nishimori

Convergence conditions for quantum annealing are derived for optimization problems represented by the Ising model of a general form. Quantum fluctuations are introduced as a transverse field and/or transverse ferromagnetic interactions, and the time evolution follows the real-time Schrodinger equation. It is shown that the system stays arbitrarily close to the instantaneous ground state, finally reaching the target optimal state, if the strength of quantum fluctuations decreases sufficiently slowly, in particular inversely proportionally to the power of time in the asymptotic region. This is the same condition as the other implementations of quantum annealing, quantum Monte Carlo and Green's function Monte Carlo simulations, in spite of the essential difference in the type of dynamics. The method of analysis is an application of the adiabatic theorem in conjunction with an estimate of a lower bound of the energy gap based on the recently proposed idea of Somma et. al. for the analysis of classical simulated annealing using a classical-quantum correspondence.

arXiv:quant-ph/0702252Journal of the Physical Society of JapanMay 25, 200741 citations

Optimization by quantum annealing: Lessons from simple cases

Lorenzo Stella, Giuseppe E. Santoro, Erio Tosatti

We investigate the basic behavior and performance of simulated quantum annealing (QA) in comparison with classical annealing (CA). Three simple one-dimensional case study systems are considered: namely, a parabolic well, a double well, and a curved washboard. The time-dependent Schr\"odinger evolution in either real or imaginary time describing QA is contrasted with the Fokker-Planck evolution of CA. The asymptotic decrease of excess energy with annealing time is studied in each case, and the reasons for differences are examined and discussed. The Huse-Fisher classical power law of double-well CA is replaced with a different power law in QA. The multiwell washboard problem studied in CA by Shinomoto and Kabashima and leading classically to a logarithmic annealing even in the absence of disorder turns to a power-law behavior when annealed with QA. The crucial role of disorder and localization is briefly discussed.

arXiv:cond-mat/0502129Physical Review BJul 6, 200558 citations

Quantum annealing: A new method for minimizing multidimensional functions

A B Finnila, M A Gomez, C. Sebenik +2 more

Abstract Quantum Monte Carlo has found a new application far afield from the solution of the Schrodinger equation for many-body problems. In this paper the authors report a method for solving multidimensional optimization problems that is superior, in many cases, to other methods such as conjugate gradient methods, the simplex method, direction-set methods, genetic methods, and classical simulated annealing. The new approach, aptly titled “quantum annealing,” is closely related to classical annealing, in which a physical system such as a metal cluster is slowly cooled and finds its lowest-energy configuration as the temperature drops to zero. In classical annealing the system follows classical-mechanical dynamics as the temperature drops. In quantum annealing a collection of configurations evolves in the the same way as walkers undergoing diffusion and multiplication in diffusion QMC with the added feature of a slowly dropping value for Planck’s constant h. Classical annealing allows the escape from local minima with the aid of thermal fluctuations. Quantum annealing allows such escape by delocalization and tunneling. Since a QMC walker can multiply in number on entering a low-energy region, a single walker can populate an entire region.

Jun 18, 200723 citations