Department of Systems Science, Graduate School of Informatics, Kyoto University, 36-1 Yoshida-Honmachi, Sakyo-ku, Kyoto, 606-8501, Japan.
Phys Rev Lett. 2010 Jul 30;105(5):050401. doi: 10.1103/PhysRevLett.105.050401. Epub 2010 Jul 26.
We show a practical application of 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. We consider to incorporate the Jarzynski equality into quantum annealing, which is one of the generic algorithms to solve the combinatorial optimization problem. The ordinary quantum annealing suffers from nonadiabatic transitions whose rate is characterized by the minimum energy gap Δmin of the quantum system under consideration. The quantum sweep speed is therefore restricted to be extremely slow for the achievement to obtain a solution without relevant errors. However, in our strategy shown in the present study, we find that such a difficulty would not matter.
我们展示了雅可比等式在量子计算中的实际应用。它的实现可能为解决组合优化问题、最小化具有多个参数的实单值函数、代价函数开辟一条途径。我们考虑将雅可比等式纳入量子退火中，这是一种解决组合优化问题的通用算法。普通的量子退火受到非绝热跃迁的影响，其速率由所考虑量子系统的最小能量隙 Δmin 来描述。因此，为了在没有相关错误的情况下获得解决方案，量子扫描速度受到极大的限制，必须非常缓慢。然而，在我们在本研究中展示的策略中，我们发现这样的困难并不重要。
