arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.03426cs.ETcs.DCcs.NE
收藏

高阶Ising机的有效优化

Efficient Optimization with Higher-Order Ising Machines

Connor Bybee, Denis Kleyko, Dmitri E. Nikonov, Amir Khosrowshahi, Bruno A. Olshausen, Friedrich T. Sommer

摘要:

在并行硬件上解决组合优化问题的一种突出方法是伊辛机,即,相互作用的二进制自旋变量网络的硬件实现。大多数伊辛机利用二阶相互作用,尽管重要的优化问题,如可满足性问题,更无缝地映射到具有高阶相互作用的伊辛网络。在这里,我们证明了高阶伊辛机可以更有效地解决可满足性问题的自旋变量的数量和它们的连接相比,传统的二阶伊辛机。此外,我们的研究结果表明,在一个基准数据集的布尔\textit{k} -可满足性问题,高阶伊辛机实现耦合振荡器迅速找到解决方案,是优于二阶伊辛机,从而提高了目前的最先进的伊辛机。

英文摘要:

A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables. Most Ising machines leverage second-order interactions although important classes of optimization problems, such as satisfiability problems, map more seamlessly to Ising networks with higher-order interactions. Here, we demonstrate that higher-order Ising machines can solve satisfiability problems more resource-efficiently in terms of the number of spin variables and their connections when compared to traditional second-order Ising machines. Further, our results show on a benchmark dataset of Boolean \textit{k}-satisfiability problems that higher-order Ising machines implemented with coupled oscillators rapidly find solutions that are better than second-order Ising machines, thus, improving the current state-of-the-art for Ising machines.

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

↑