arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.05547quant-phcs.ITcs.LGhep-thmath.IT
收藏

变分的Jordan-Lee-Preskill量子算法

Towards a variational Jordan-Lee-Preskill quantum algorithm

California Institute of Technology(加州理工学院);The University of Chicago(芝加哥大学);University of Cambridge(剑桥大学);Peking University(北京大学);Stanford University(斯坦福大学);University of Oxford(牛津大学)

Junyu Liu, Zimu Li, Han Zheng, Xiao Yuan, Jinzhao Sun

摘要:

量子信息技术的快速发展为在近期量子器件中模拟量子场论提供了广阔的前景。在这项工作中,我们制定的理论(含时)变分量子模拟的1+1维$λϕ^4$量子场论,包括编码,状态准备和时间演化,与一些数值模拟结果。这些算法可以被理解为Jordan-Lee-Preskill算法的近期变分量子线路(量子神经网络)类似物,Jordan-Lee-Preskill算法是使用通用量子设备模拟量子场论的基本算法。此外,我们突出的优势,基于LSZ约化公式和几个计算效率,如实施玻色子版本的酉耦合团簇anananterior准备初始状态的基础上与谐振子基编码。我们还讨论了如何避免量子场论模拟中的“谱拥挤”问题,并从态和子空间两个方面对我们的算法进行了评价。

英文摘要:

Rapid developments of quantum information technology show promising opportunities for simulating quantum field theory in near-term quantum devices. In this work, we formulate the theory of (time-dependent) variational quantum simulation of the 1+1 dimensional $λϕ^4$ quantum field theory including encoding, state preparation, and time evolution, with several numerical simulation results. These algorithms could be understood as near-term variational quantum circuit (quantum neural network) analogs of the Jordan-Lee-Preskill algorithm, the basic algorithm for simulating quantum field theory using universal quantum devices. Besides, we highlight the advantages of encoding with harmonic oscillator basis based on the LSZ reduction formula and several computational efficiency such as when implementing a bosonic version of the unitary coupled cluster ansatz to prepare initial states. We also discuss how to circumvent the "spectral crowding" problem in the quantum field theory simulation and appraise our algorithm by both state and subspace fidelities.

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

↑