A comparison of classical and quantum annealing dynamics
Sei Suzuki · Journal of Physics Conference Series · 2009
Simulated annealing and quantum annealing are algorithms for combinatorial optimization problems. The former brings solutions using thermal fluctuations and through classical dynamics, while the latter does using quantum fluctuations and through quantum dynamics. In this paper, dynamics of these two algorithms are compared by means of the Kibble-Zurek argument, employing a one-dimensional random Ising model as an exercise for algorithms. We reveal that quantum annealing reduces residual errors faster than simulated annealing with decreasing annealing rate. The result implies the advantage of quantum annealing over simulated annealing.