TY - JOUR
T1 - Quantum annealing with Jarzynski equality
AU - Ohzeki, Masayuki
AU - Nishimori, Hidetoshi
N1 - Funding Information:
This work was supported by CREST, JST .
PY - 2011/1
Y1 - 2011/1
N2 - We show a practical application of a well-known nonequilibrium relation, the Jarzynski equality, in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments. It has been disclosed that the ordinary quantum computational algorithm to solve a kind of hard optimization problems, has a bottleneck that its computational time is restricted to be extremely slow without relevant errors. However, by our novel strategy shown in the present study, we might overcome such a difficulty.
AB - We show a practical application of a well-known nonequilibrium relation, the Jarzynski equality, in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments. It has been disclosed that the ordinary quantum computational algorithm to solve a kind of hard optimization problems, has a bottleneck that its computational time is restricted to be extremely slow without relevant errors. However, by our novel strategy shown in the present study, we might overcome such a difficulty.
KW - Jarzynski equality
KW - Optimization problem
KW - Quantum annealing
UR - http://www.scopus.com/inward/record.url?scp=78149359317&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78149359317&partnerID=8YFLogxK
U2 - 10.1016/j.cpc.2010.07.008
DO - 10.1016/j.cpc.2010.07.008
M3 - Article
AN - SCOPUS:78149359317
SN - 0010-4655
VL - 182
SP - 257
EP - 259
JO - Computer Physics Communications
JF - Computer Physics Communications
IS - 1
ER -