arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0404143quant-ph
收藏

在II型量子计算机上模拟伊辛模型的算法

An algorithm for simulating the Ising model on a type-II quantum computer

J. H. Cole, L. C. L. Hollenberg, S. Prawer

摘要:

本文提出了一种II型量子计算机的算法,它在一维和二维中模拟了伊辛模型。它等效于Metropolis Monte-Carlo方法,并利用量子叠加产生随机数。该算法不需要在每次迭代结束时测量状态的集合,这是其他II型算法所需的。在每个节点处仅测量二进制结果,这意味着该算法可以使用一系列不同的量子计算架构来实现。伊辛模型提供了一个例子,说明如何用公式表达元胞自动机规则,使其在II型量子计算机上运行。

英文摘要:

Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte-Carlo method and takes advantage of quantum superposition for random number generation. This algorithm does not require the ensemble of states to be measured at the end of each iteration, as is required for other type-II algorithms. Only the binary result is measured at each node which means this algorithm could be implemented using a range of different quantum computing architectures. The Ising model provides an example of how cellular automata rules can be formulated to be run on a type-II quantum computer.

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

↑