arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.14760cs.ETcond-mat.stat-mech
收藏

可扩展的近线性动力学伊辛机

Scalable almost-linear dynamical Ising machines

University of Michigan(密歇根大学)

Aditya Shukla, Mikhail Erementchouk, Pinaki Mazumder

AI总结:

本文提出了一种可扩展的近线性动力学伊辛机,通过近线性耦合模拟自旋实现高效解决组合优化问题,并展示了其在加权图上的性能表现。

摘要:

过去十年中,伊辛机逐渐出现,旨在通过最小化由连续动力学变量表示的伊辛哈密顿量来解决硬组合优化问题。然而,这些机器在更大规模上的能力尚未得到充分探索。我们研究了一种基于近线性耦合模拟自旋的伊辛机。我们证明此类网络利用的计算资源类似于伊辛模型的半正定松弛。我们估计了近线性机器的预期性能,并在一组{0,1}加权图上进行了基准测试。我们证明了所研究的机器的运行时间与连接图中的边数呈多项式关系(线性关系)。作为机器物理实现的例子,我们提出了一种CMOS兼容的实现,包括一个高效存储连续自旋的电容器阵列,并通过模拟电流与外部通信。

英文摘要:

The past decade has seen the emergence of Ising machines targeting hard combinatorial optimization problems by minimizing the Ising Hamiltonian with spins represented by continuous dynamical variables. However, capabilities of these machines at larger scales are yet to be fully explored. We investigate an Ising machine based on a network of almost-linearly coupled analog spins. We show that such networks leverage the computational resource similar to that of the semidefinite positive relaxation of the Ising model. We estimate the expected performance of the almost-linear machine and benchmark it on a set of {0,1}-weighted graphs. We show that the running time of the investigated machine scales polynomially (linearly with the number of edges in the connectivity graph). As an example of the physical realization of the machine, we present a CMOS-compatible implementation comprising an array of vertices efficiently storing the continuous spins on charged capacitors and communicating externally via analog current.

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

↑