.png){kind=icon}
返回
Massively parallel probabilistic computing with sparse Ising machines
.png){kind=icon}
PRE
AI
DOI：10.1038/s41928-022-00774-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solving computationally hard problems using conventional computing architectures is often slow and energetically inefficient. Quantum computing may help with these challenges, but it is still in the early stages of development. A quantum-inspired alternative is to build domain-specific architectures with classical hardware. Here we report a sparse Ising machine that achieves massive parallelism where the flips per second-the key figure of merit-scales linearly with the number of probabilistic bits. Our sparse Ising machine architecture, prototyped on a field-programmable gate array, is up to six orders of magnitude faster than standard Gibbs sampling on a central processing unit, and offers 5-18 times improvements in sampling speed compared with approaches based on tensor processing units and graphics processing units. Our sparse Ising machine can reliably factor semi-primes up to 32 bits and it outperforms competition-winning Boolean satisfiability solvers in approximate optimization. Moreover, our architecture can find the correct ground state, even when inexact sampling is made with faster clocks. Our problem encoding and sparsification techniques could be applied to other classical and quantum Ising machines, and our architecture could potentially be scaled to 1,000,000 or more p-bits using analogue silicon or nanodevice technologies. Sparsification techniques can be used to create Ising machines prototyped on field-programmable gate arrays that can quickly and efficiently solve combinatorial optimization problems.
Keyword:
OPTIMIZATION
期刊
IF:
40.9
论文数:
1.7K
被引数:
2.1W
机构
引用论文
An Ising Hamiltonian solver based on coupled stochastic phase-transition nano-oscillators.png)
NATURE ELECTRONICS
OAAI
NATURE ELECTRONICSIF40.9
OAAI分享收藏分享收藏Logically synthesized and hardware-accelerated restricted Boltzmann machines for combinatorial optimization and integer factorizationNATURE ELECTRONICS
NATURE ELECTRONICSIF40.9
PREAI
分享收藏Multi-GPU accelerated multi-spin Monte Carlo simulations of the 2D Ising model二维伊辛模型的多GPU加速多自旋蒙特卡罗模拟OAAI
OAAI分享收藏
查看更多内容