arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.04537math.NAcs.NAmath-phmath.MP
收藏

求解高维线性与多尺度偏微分方程的量子差分方法的时间复杂度分析

Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations

Shi Jin, Nana Liu, Yue Yu

AI总结:

该研究分析了求解高维线性与多尺度偏微分方程的量子差分方法的时间复杂度,对比了显式、隐式离散下的量子优势,发现多尺度AP格式的时间复杂度不依赖缩放参数,证明其在量子计算多尺度问题中仍有重要开发价值。

摘要:

我们研究了用量子算法(以下称为“量子差分方法”)求解高维线性热方程、高维线性双曲方程和多尺度双曲热系统的有限差分方法的时间复杂度。针对热方程和线性双曲方程,我们分析了显式与隐式时间离散化对量子方法相较于经典差分方法的优势的影响。针对多尺度问题,我们发现显式格式的经典处理与量子处理的时间复杂度均按$\u27e8\uc6d4(1/\u03b5)$缩放,其中$\u03b5$为缩放参数,而多尺度Asymptotic-Preserving(AP,渐近保持)格式的缩放不依赖于$\u03b5$。这表明在量子计算领域,针对多尺度问题开发AP格式仍具有重要意义。

英文摘要:

We investigate time complexities of finite difference methods for solving the high-dimensional linear heat equation, the high-dimensional linear hyperbolic equation and the multiscale hyperbolic heat system with quantum algorithms (hence referred to as the "quantum difference methods"). For the heat and linear hyperbolic equations we study the impact of explicit and implicit time discretizations on quantum advantages over the classical difference method. For the multiscale problem, we find the time complexity of both the classical treatment and quantum treatment for the explicit scheme scales as $\mathcal{O}(1/\varepsilon)$, where $\varepsilon$ is the scaling parameter, while the scaling for the multiscale Asymptotic-Preserving (AP) schemes does not depend on $\varepsilon$. This indicates that it is still of great importance to develop AP schemes for multiscale problems in quantum computing.

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

↑