nadja in wbo

Yesterday, since the third DEX-SMI seminar was held, I took part in.

This seminar's talker is Prof. Nishimori and he is introducing on his current work with his student, that is to say quantum annealing. Note that the theme in this talk is surveyed in arXiv.. Quantum annealing is well-known as one of the most glamorous algorithm based on quantum physics in order to assess the optimization problem. Because I am not good at demonstrating quantum annealing in detail, if you like to know, would you check here?

One of the difficulty in the assessment the optimization problem by utilizing quantum annealing is the annealing schedule so as to evaluate the global minima or maxima. The aim of his present work is to resolve the difficulty and to guarantee mathematically to catch up with the ground state, that is the optimal in given physical system. Namely, their strategy accepted is worst case analysis and upper bound evaluation. It is only simple but powerful scheme.

Geman-Geman conjecture states that if simulated annealing schedule in the case of sufficient large time is satisfied with the inequality as follows;

T(t)>pN/(log(t))

where "T(t)" is termed absolute temperature, "N" represents the system size, "p" indicates constant depended on the problem, and "t" is time, then the simulated annealing algorithm is typically able to keep up with the ground state. This speaker has been developing this conjecture with respect to the case of quantum annealing and more general case. Unfortunately so I am bad at quantum physics, although I can't get it in detail, I can get only to appreciate their result. How a wonderful it is!

If you would like to know the result obtained, you could directly mail to Prof. Nishimori.

Ciao!