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

基于正交级数密度估计划分随机过程时间演化的量子电路

Dividing quantum circuits for time evolution of stochastic processes by orthogonal series density estimation

Koichi Miyamoto

AI总结:

本文提出基于正交级数密度估计划分量子电路的方法,将随机过程时间演化的量子电路深度和总查询复杂度分别降至$O(\sqrt{N})$和$O(N^{3/2})$,避免了深电路问题。

摘要:

量子蒙特卡洛积分(QMCI)是一种用于估计随机变量期望值的量子算法,可应用于金融衍生品定价等多个工业领域。当将QMCI应用于涉及随机过程$X(t)$(例如衍生品定价中的标的资产价格)的期望值估计时,用于生成编码$X(t)$概率密度的量子态的量子电路$U_{X(t)}$可能会有很大的深度。在将时间离散化为$N$个点的情况下,使用$X(t)$转移概率的状态准备预言机,$X(t)$的状态准备会导致$O(N)$的深度,这对于较大的$N$可能是有问题的。此外,如果我们在$N$个时间点估计关于$X(t)$的期望值,总查询复杂度在$N$上的规模为$O(N^2)$,这比经典蒙特卡洛方法中$O(N)$的复杂度更差。在本文中,为了改进这一点,我们提出了一种基于正交级数密度估计来划分$U_{X(t)}$的方法。该方法涉及用正交级数近似$N$个时间点上$X(t)$的密度,其中系数通过QMCI估计为正交函数的期望值。通过使用这些近似密度,我们可以通过QMCI估计关于$X(t)$的期望值,而无需深电路。我们的误差和复杂度分析表明,为了获得$N$个时间点上的近似密度,我们的方法实现了分别按$O(\sqrt{N})$和$O(N^{3/2})$缩放的电路深度和总查询复杂度。

英文摘要:

Quantum Monte Carlo integration (QMCI) is a quantum algorithm to estimate expectations of random variables, with applications in various industrial fields such as financial derivative pricing. When QMCI is applied to expectations concerning a stochastic process $X(t)$, e.g., an underlying asset price in derivative pricing, the quantum circuit $U_{X(t)}$ to generate the quantum state encoding the probability density of $X(t)$ can have a large depth. With time discretized into $N$ points, using state preparation oracles for the transition probabilities of $X(t)$, the state preparation for $X(t)$ results in a depth of $O(N)$, which may be problematic for large $N$. Moreover, if we estimate expectations concerning $X(t)$ at $N$ time points, the total query complexity scales on $N$ as $O(N^2)$, which is worse than the $O(N)$ complexity in the classical Monte Carlo method. In this paper, to improve this, we propose a method to divide $U_{X(t)}$ based on orthogonal series density estimation. This approach involves approximating the densities of $X(t)$ at $N$ time points with orthogonal series, where the coefficients are estimated as expectations of the orthogonal functions by QMCI. By using these approximated densities, we can estimate expectations concerning $X(t)$ by QMCI without requiring deep circuits. Our error and complexity analysis shows that to obtain the approximated densities at $N$ time points, our method achieves the circuit depth and total query complexity scaling as $O(\sqrt{N})$ and $O(N^{3/2})$, respectively.

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

↑