arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.09836cs.ETcond-mat.dis-nnquant-ph
收藏

使用p位的概率计算

Probabilistic computing with p-bits

Jan Kaiser, Supriyo Datta

摘要:

数字计算机以比特的形式存储信息,比特可以取0和1中的一个值,而量子计算机基于由复波函数描述的量子比特,其平方幅度给出了测量0或1的概率。在这里,我们提出了一个基于p位的概率计算机,它以受控的概率取0和1的值,并且可以用专门的紧凑型节能硬件来实现。我们提出了一个通用的体系结构,这样的p-计算机和仿真系统与成千上万的p-位,以表明他们可以显着加速随机算法在各种各样的应用程序,包括但不限于贝叶斯网络,优化,伊辛模型,和量子蒙特卡罗。

英文摘要:

Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction, whose squared magnitude gives the probability of measuring either 0 or 1. Here, we make the case for a probabilistic computer based on p-bits, which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware. We propose a generic architecture for such p-computers and emulate systems with thousands of p-bits to show that they can significantly accelerate randomized algorithms used in a wide variety of applications including but not limited to Bayesian networks, optimization, Ising models, and quantum Monte Carlo.

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

↑