TY - JOUR
T1 - Quantum annealing
T2 - An introduction and new developments
AU - Ohzeki, Masayuki
AU - Nishimori, Hidetoshi
PY - 2011/6
Y1 - 2011/6
N2 - Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary results for an alternative method. The review part includes the relationship of quantum annealing with classical simulated annealing. We next propose a novel quantum algorithm which might be available for hard optimization problems by using a classical-quantum mapping as well as the Jarzynski equality introduced in nonequilibrium statistical physics.
AB - Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary results for an alternative method. The review part includes the relationship of quantum annealing with classical simulated annealing. We next propose a novel quantum algorithm which might be available for hard optimization problems by using a classical-quantum mapping as well as the Jarzynski equality introduced in nonequilibrium statistical physics.
KW - Combinatorial optimization problems
KW - Jarzynski equality
KW - Quantum annealing
UR - http://www.scopus.com/inward/record.url?scp=79955375271&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79955375271&partnerID=8YFLogxK
U2 - 10.1166/jctn.2011.1776963
DO - 10.1166/jctn.2011.1776963
M3 - Review article
AN - SCOPUS:79955375271
SN - 1546-1955
VL - 8
SP - 963
EP - 971
JO - Journal of Computational and Theoretical Nanoscience
JF - Journal of Computational and Theoretical Nanoscience
IS - 6
ER -