arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.09203quant-phcond-mat.stat-mechcond-mat.str-el
收藏

基于量子计算机的无偏量子蒙特卡罗算法的指数挑战

Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers

Guglielmo Mazzola, Giuseppe Carleo

摘要:

最近,Huggins et.等人[Nature,603,416-420(2022)]设计了一种适用于在量子计算机上实现的通用投影量子蒙特卡罗方法。然而,这种混合方法依赖于一个子程序-量子计算机上的局部能量估计器的计算-它本质上受到计算时间与量子位数的指数缩放的影响。通过数值实验,我们表明,这种指数标度已经显着低于“量子优势“点的系统。对于典型的横向场伊辛模型,我们表明,所需的时间资源,以竞争与经典模拟约40量子位已经是$10^{13}$投影测量的顺序,与超导硬件上的估计运行时间为几千年。这些观察结果强烈表明,所提出的混合方法,在其目前的形式,是不可能提供一个相当大的优势,比传统的量子蒙特卡罗方法。

英文摘要:

Recently, Huggins et. al. [Nature, 603, 416-420 (2022)] devised a general projective Quantum Monte Carlo method suitable for implementation on quantum computers. This hybrid approach, however, relies on a subroutine -the computation of the local energy estimator on the quantum computer -that is intrinsically affected by an exponential scaling of the computational time with the number of qubits. By means of numerical experiments, we show that this exponential scaling manifests prominently already on systems below the point of "quantum advantage". For the prototypical transverse-field Ising model, we show that the required time resources to compete with classical simulations on around 40 qubits are already of the order of $10^{13}$ projective measurements, with an estimated running time of a few thousand years on superconducting hardware. These observations strongly suggest that the proposed hybrid method, in its present form, is unlikely to offer a sizeable advantage over conventional quantum Monte Carlo approaches.

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

↑