arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.10705quant-phcond-mat.dis-nncond-mat.stat-mechcs.CCcs.LG
收藏

Gibbs抽样中的计算相变特征

Computational Phase Transition Signature in Gibbs Sampling

Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究院)

H. Philathong, V. Akshay, I. Zacharov, J. Biamonte

摘要:

吉布斯采样是广泛的计算机算法的基础。这样的算法被设置为由基于物理的处理器$-$代替,无论是量子还是随机退火设备$-$,其嵌入问题实例并将物理系统演化为系综以恢复概率分布。在一个关键的约束变量比,决策问题$-$,如命题可满足性$-$出现统计上表现出所需的计算资源的突然转变。这种所谓的算法或计算相变签名在当代基于物理学的处理器中尚未被观察到。我们发现,计算相变承认在吉布斯分布的签名,因此,我们预测和规定的物理观察这种效果。我们模拟了这样一个实验,当实验实现时,我们相信这将代表计算物理理论的一个里程碑。

英文摘要:

Gibbs sampling is fundamental to a wide range of computer algorithms. Such algorithms are set to be replaced by physics based processors$-$be it quantum or stochastic annealing devices$-$which embed problem instances and evolve a physical system into an ensemble to recover a probability distribution. At a critical constraint to variable ratio, decision problems$-$such as propositional satisfiability$-$appear to statistically exhibit an abrupt transition in required computational resources. This so called, algorithmic or computational phase transition signature, has yet-to-be observed in contemporary physics based processors. We found that the computational phase transition admits a signature in Gibbs' distributions and hence we predict and prescribe the physical observation of this effect. We simulate such an experiment, that when realized experimentally, we believe would represent a milestone in the physical theory of computation.

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

↑