arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2412.14868quant-ph
收藏

随机微分方程的量子算法:一种 Schrödingerisation 方法

Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach

Shi Jin, Nana Liu, Wei Wei

AI总结:

本文提出一种基于Schrödingerisation方法的线性随机微分方程量子算法,将噪声项视为离散强迫项,适用于Gaussian和α-stable Lévy噪声,门复杂度在维度和样本量上达O(dlog(Nd)),相比经典算法实现显著加速。

摘要:

量子计算机以在特定问题上相比经典计算机实现高达指数级加速的潜力而闻名。为了发挥量子计算机的优势,我们提出了针对线性随机微分方程的量子算法,利用 Schrödingerisation 方法处理相应的近似方程,方法是将噪声项视为(时间离散的)强迫项。我们的算法适用于具有 Gaussian 噪声和 $α$-stable Lévy 噪声的随机微分方程。算法的门复杂度在维度 $d$ 和样本大小 $N$ 上表现出 $\mathcal{O}(d\log(Nd))$ 的依赖关系,而在涉及大样本量的场景中,其对应的经典算法需要近乎指数级更大的复杂度。在 Gaussian 噪声情况下,我们证明了近似方程在均方范数下的一阶强收敛性。这些算法在 Ornstein-Uhlenbeck 过程、几何 Brownian 运动和一维 Lévy 飞行中得到了数值验证。

英文摘要:

Quantum computers are known for their potential to achieve up-to-exponential speedup compared to classical computers for certain problems. To exploit the advantages of quantum computers, we propose quantum algorithms for linear stochastic differential equations, utilizing the Schrödingerisation method for the corresponding approximate equation by treating the noise term as a (discrete-in-time) forcing term. Our algorithms are applicable to stochastic differential equations with both Gaussian noise and $α$-stable Lévy noise. The gate complexity of our algorithms exhibits an $\mathcal{O}(d\log(Nd))$ dependence on the dimensions $d$ and sample sizes $N$, where its corresponding classical counterpart requires nearly exponentially larger complexity in scenarios involving large sample sizes. In the Gaussian noise case, we show the strong convergence of first order in the mean square norm for the approximate equations. The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, geometric Brownian motions, and one-dimensional Lévy flights.

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

↑