当前位置: X-MOL 学术npj Quantum Inform. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Sign-problem free quantum stochastic series expansion algorithm on a quantum computer
npj Quantum Information ( IF 7.6 ) Pub Date : 2022-04-26 , DOI: 10.1038/s41534-022-00555-x
Kok Chuan Tan 1, 2 , Dhiman Bhowmick 2 , Pinaki Sengupta 2
Affiliation  

A quantum implementation of the Stochastic Series Expansion (SSE) Monte Carlo method is proposed, and is shown to offer significant advantages over classical implementations of SSE. In particular, for problems where classical SSE encounters the sign problem, the cost of implementing a Monte Carlo iteration scales only linearly with system size in quantum SSE, while it may scale exponentially with system size in classical SSE. In cases where classical SSE can be efficiently implemented, quantum SSE still offers an advantage by allowing for more general observables to be measured.



中文翻译:

量子计算机上的无符号问题量子随机级数展开算法

提出了随机级数展开 (SSE) Monte Carlo 方法的量子实现,并显示出与 SSE 的经典实现相比具有显着优势。特别是,对于经典 SSE 遇到符号问题的问题,在量子 SSE 中实现蒙特卡罗迭代的成本仅与系统大小呈线性关系,而在经典 SSE 中它可能与系统大小呈指数关系。在可以有效实现经典 SSE 的情况下,量子 SSE 仍然具有优势,因为它允许测量更一般的可观察量。

更新日期:2022-04-27
down
wechat
bug