Nachman Benjamin, Provasoli Davide, de Jong Wibe A, Bauer Christian W
Physics Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720, USA.
Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720, USA.
Phys Rev Lett. 2021 Feb 12;126(6):062001. doi: 10.1103/PhysRevLett.126.062001.
Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.
模拟量子场论是量子计算的一项旗舰应用。然而,完全在量子计算机上计算与实验相关的高能散射振幅极其困难。众所周知,此类高能散射过程可分解为能用成熟微扰技术计算的部分,以及目前必须使用经典马尔可夫链算法模拟的部分。这些经典马尔可夫链模拟方法能很好地捕捉许多显著特征,但无法捕捉所有量子效应。为了以最有效的方式利用量子资源,我们引入了一种场论中量子算法的新范式。这种方法仅将量子计算机用于现有技术无法计算的问题部分。特别是,我们开发了一种多项式时间量子末态簇射,它能精确模拟中间自旋态的效应,类似于高能电弱簇射中存在的那些效应,并带有一个全局演化变量。该算法在量子计算机上针对一个简化的量子场论进行了明确演示。