arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.10908cond-mat.dis-nncs.DSquant-ph
收藏

增强自由能景观中的量子行走:具有增强的量子退火

Quantum walk in a reinforced free-energy landscape: Quantum annealing with reinforcement

Abolfazl Ramezanpour

摘要:

为量子退火算法提供最佳路径是为计算困难的优化问题找到良好近似解的关键。强化是一种策略,可以用来规避指数小的能隙的系统在退火过程中。在这里,一个依赖于时间的加强项被添加到哈密顿量,以使更低的能量的最可能的状态的发展系统。在这项研究中,我们采取了局部熵的配置空间的加固和应用该算法的一些简单和困难的优化问题。在量子搜索问题中,增强算法的性能优于标准量子退火算法,其中最优参数的行为取决于解的数量。此外,增强体可以改变平均场p自旋模型($p>2$)的不连续相变为连续相变。该算法在二进制感知器问题上的性能也优于标准量子退火算法,后者已经比经典的模拟退火算法更好。

英文摘要:

Providing an optimal path to a quantum annealing algorithm is key to finding good approximate solutions to computationally hard optimization problems. Reinforcement is one of the strategies that can be used to circumvent the exponentially small energy gaps of the system in the annealing process. Here a time-dependent reinforcement term is added to the Hamiltonian in order to give lower energies to the most probable states of the evolving system. In this study, we take a local entropy in the configuration space for the reinforcement and apply the algorithm to a number of easy and hard optimization problems. The reinforced algorithm performs better than the standard quantum annealing algorithm in the quantum search problem, where the optimal parameters behave very differently depending on the number of solutions. Moreover, the reinforcements can change the discontinuous phase transitions of the mean-field p-spin model ($p>2$) to a continuous transition. The algorithm's performance in the binary perceptron problem is also superior to that of the standard quantum annealing algorithm, which already works better than a classical simulated annealing algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑