arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.02691quant-phcond-mat.stat-mechcond-mat.str-elhep-latphysics.comp-ph
收藏

面向经典计算与量子计算的优化Trotter分解

Optimised Trotter Decompositions for Classical and Quantum Computing

Johann Ostmeyer

AI总结:

该研究将双算符优化Trotter分解推广至多算符通用场景,补充多阶新分解方案,证明经典设备上结合泰勒展开可远超现有Trotter化方案的精度,并给出最优分解选择指南。

摘要:

指数算符(如$\boldsymbol{\exp(Ht)}$)的Suzuki-Trotter分解几乎是数值物理所有分支的必备工具。待处理的指数项通常需拆分为两个以上的算符,即$H=\sum_k A_k$,例如量子计算机上的局域门便属于此类情形。\n我们展示了最初针对恰好两个算符$A_{1,2}$推导的高优化方案如何应用于这类通用Suzuki-Trotter分解,同时给出了正确性的形式化证明以及效率的数值证据。本文全面综述了阶数$n\le4$的现有对称分解方案,并补充了多种新方案,涵盖实系数与复系数两类。我们推导了理论上最高效的幺正与非幺正4阶分解方案,还补充了若干阶数$n\le8$的高效高阶方案。此外我们证明,在经典设备上利用泰勒展开可达到机器精度,而当前最先进的Trotter化方案在相同计算量下相对精度仅能达到$10^{-4}$。最后,本文通过简短易懂的总结说明了如何在任意给定场景下选择最优分解方案。

英文摘要:

Suzuki-Trotter decompositions of exponential operators like $\exp(Ht)$ are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators $H=\sum_k A_k$, for instance as local gates on quantum computers. We demonstrate how highly optimised schemes originally derived for exactly two operators $A_{1,2}$ can be applied to such generic Suzuki-Trotter decompositions, providing a formal proof of correctness as well as numerical evidence of efficiency. A comprehensive review of existing symmetric decomposition schemes up to order $n\le4$ is presented and complemented by a number of novel schemes, including both real and complex coefficients. We derive the theoretically most efficient unitary and non-unitary 4th order decompositions. The list is augmented by several exceptionally efficient schemes of higher order $n\le8$. Furthermore we show how Taylor expansions can be used on classical devices to reach machine precision at a computational effort at which state of the art Trotterization schemes do not surpass a relative precision of $10^{-4}$. Finally, a short and easily understandable summary explains how to choose the optimal decomposition in any given scenario.

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

↑