Monte Carlo integration using quantum computers has been widely investigated, including applications to concrete problems. It is known that quantum algorithms based on quantum amplitude estimation (QAE) can compute an integral with a smaller number of iterative calls of the quantum circuit which calculates the integrand, than classical methods call the integrand subroutine. However, the issues about the iterative operations in the integrand circuit have not been discussed so much. That is, in the high-dimensional integration, many random numbers are used for calculation of the integrand and in some cases similar calculations are repeated to obtain one sample value of the integrand. In this paper, we point out that we can reduce the number of such repeated operations by a combination of the nested QAE and the use of pseudorandom numbers (PRNs), if the integrand has the separable form with respect to contributions from distinct random numbers. The use of PRNs, which the authors originally proposed in the context of the quantum algorithm for Monte Carlo, is the key factor also in this paper, since it enables parallel computation of the separable terms in the integrand. Furthermore, we pick up one use case of this method in finance, the credit portfolio risk measurement, and estimate to what extent the complexity is reduced.
Gravitational wave matched filtering by quantum Monte Carlo integration and quantum amplitude amplification
通过量子计算来加速繁重的数值任务,现在在包括物理学和天文学中的数据分析在内的各个领域都在积极研究。本文在Gao等人工作的基础上,提出了一种新的用于引力波(GW)数据分析的量子匹配滤波算法,Phys. Rev. Research 4,023006(2022)[arXiv:2109.01535]。我们的方法使用量子算法的Monte Carlo积分的信噪比(SNR)的计算,而不是在高等人使用的快速傅立叶变换。和搜索信号模板与高信噪比的量子振幅放大。通过这种方式,与Gao等人相比,我们实现了量子比特数的指数减少。的算法,保持了二次加速比经典GW匹配滤波的模板数量。
Quantum Speedups for Derivative Pricing Beyond Black-Scholes
Global Technology Applied Research, JPMorganChase(摩根大通全球应用技术研究);Center for Theoretical Physics – a Leinweber Institute, MIT(麻省理工学院莱因韦伯理论物理中心);Quantitative Trading & Research, JPMorganChase(摩根大通量化交易与研究)