arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.00234quant-phcs.AIcs.LG
收藏

强化量子退火:一种量子辅助学习自动机方法

Reinforcement Quantum Annealing: A Quantum-Assisted Learning Automata Approach

University of Maryland, Baltimore County(马里兰大学巴尔的摩县分校)

Ramin Ayanzadeh, Milton Halem, Tim Finin

摘要:

我们介绍了强化量子退火(RQA)计划,其中智能代理与量子退火机,扮演学习自动机的随机环境的作用,并试图迭代地找到更好的伊辛哈密顿为给定的问题的兴趣。作为一个概念验证,我们提出了一种新的方法,减少了NP完全问题的布尔可满足性(SAT),以最大限度地减少伊辛哈密尔顿算子,并展示了如何应用RQA增加找到全局最优的概率。我们在两个不同的基准SAT问题(即分解伪素数和随机SAT与相变)上的实验结果,使用D-Wave 2000 Q量子处理器,表明RQA发现了更好的解决方案,更少的样本,与量子退火领域的最先进的技术相比。

英文摘要:

We introduce the reinforcement quantum annealing (RQA) scheme in which an intelligent agent interacts with a quantum annealer that plays the stochastic environment role of learning automata and tries to iteratively find better Ising Hamiltonians for the given problem of interest. As a proof-of-concept, we propose a novel approach for reducing the NP-complete problem of Boolean satisfiability (SAT) to minimizing Ising Hamiltonians and show how to apply the RQA for increasing the probability of finding the global optimum. Our experimental results on two different benchmark SAT problems (namely factoring pseudo-prime numbers and random SAT with phase transitions), using a D-Wave 2000Q quantum processor, demonstrated that RQA finds notably better solutions with fewer samples, compared to state-of-the-art techniques in the realm of quantum annealing.

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

↑