arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.10018hep-phquant-ph
收藏

利用动态量子电路提高末态辐射量子模拟效率

Improving Quantum Simulation Efficiency of Final State Radiation with Dynamic Quantum Circuits

Plato Deliyannis, James Sud, Diana Chamaki, Zoë Webb-Mack, Christian W. Bauer, Benjamin Nachman

AI总结:

本研究利用动态量子计算改进量子粒子簇射模拟算法,降低计算深度和量子比特需求,并通过模拟验证其有效性,显著提升量子模拟效率。

摘要:

参考文献arXiv:1904.03196最近引入了一种算法(QPS),用于在数字量子计算机上使用多项式资源模拟具有中间味态的粒子簇射。我们利用一种称为动态量子计算的新量子硬件能力来改进该算法的缩放,从而显著提高方法的精度。具体而言,我们修改了量子粒子簇射电路,以纳入电路中途量子比特测量、重置以及基于经典信息的条件量子操作。这将计算深度从$\mathcal{O}(N^5\log_2(N)^2)$降低到$\mathcal{O}(N^3\log_2(N)^2)$,量子比特需求从$\mathcal{O}(N\log_2(N))$降低到$\mathcal{O}(N)$。使用“矩阵乘积态”态矢量模拟器,我们证明了改进后的算法在2、3、4和5步算法中均产生了预期结果。我们与原始QPS算法的绝对成本进行了比较,并表明动态量子计算可以显著降低代表量子行走的数字量子算法类别(包括QPS)的成本。

英文摘要:

Reference arXiv:1904.03196 recently introduced an algorithm (QPS) for simulating parton showers with intermediate flavor states using polynomial resources on a digital quantum computer. We make use of a new quantum hardware capability called dynamical quantum computing to improve the scaling of this algorithm to significantly improve the method precision. In particular, we modify the quantum parton shower circuit to incorporate mid-circuit qubit measurements, resets, and quantum operations conditioned on classical information. This reduces the computational depth from $\mathcal{O}(N^5\log_2(N)^2)$ to $\mathcal{O}(N^3\log_2(N)^2)$ and the qubit requirements are reduced from $\mathcal{O}(N\log_2(N))$ to $\mathcal{O}(N)$. Using "matrix product state" statevector simulators, we demonstrate that the improved algorithm yields expected results for 2, 3, 4, and 5-steps of the algorithm. We compare absolute costs with the original QPS algorithm, and show that dynamical quantum computing can significantly reduce costs in the class of digital quantum algorithms representing quantum walks (which includes the QPS).

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

↑