arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0008124quant-phcs.NAmath.NA
收藏

积分的量子复杂度

Quantum Complexity of Integration

Erich Novak

AI总结:

研究量子计算机在计算Hölder类函数积分时的复杂度,发现量子算法在光滑性较小时相对于确定性算法有指数加速,相对于随机化经典方法有近似二次加速。

摘要:

已知量子计算机在某些离散问题上具有加速效果。本文旨在探究量子计算机是否对连续问题有用。我们研究了来自经典Hölder类(d变量)函数的积分计算。确定性和(一般)随机化方法的最优复杂度阶是已知的。我们得到了量子算法以及受限蒙特卡洛方法(仅使用抛硬币而非一般随机数)的相应最优阶。总结结果,可以得出:(1)当光滑性较小时,量子算法相对于确定性(经典)算法有指数加速;(2)当光滑性较小时,量子算法相对于随机化经典方法有(大致)二次加速。

英文摘要:

It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Hoelder classes with d variables. The optimal orders for the complexity of deterministic and (general) randomized methods are known. We obtain the respective optimal orders for quantum algorithms and also for restricted Monte Carlo (only coin tossing instead of general random numbers). To summarize the results one can say that (1) there is an exponential speed-up of quantum algorithms over deterministic (classical) algorithms, if the smoothness is small; (2) there is a (roughly) quadratic speed-up of quantum algorithms over randomized classical methods, if the smoothness is small.

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

↑