arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv quant-ph/0311148quant-ph
收藏

随机化和量子算法加速初值问题

Randomized and Quantum Algorithms Yield a Speed-Up for Initial-Value Problems

Boleslaw Kacewicz

摘要:

量子算法和复杂性最近不仅研究了离散问题,而且也研究了一些数值问题。到目前为止,大多数注意力都集中在积分问题上,量子计算机相对于经典计算机上的确定性和随机算法表现出了加速。本文研究了初值问题的随机复杂性和量子复杂性。对于这个非线性问题,我们表明,随机和量子算法产生的速度比确定性算法。在随机和量子设置的复杂性上界所示,通过构建一个合适的成本,其中的建设是基于积分信息的算法。下限由积分问题的各自界限产生。

英文摘要:

Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers with respect to deterministic and randomized algorithms on a classical computer. In this paper we deal with the randomized and quantum complexity of initial-value problems. For this nonlinear problem, we show that both randomized and quantum algorithms yield a speed-up over deterministic algorithms. Upper bounds on the complexity in the randomized and quantum settings are shown by constructing algorithms with a suitable cost, where the construction is based on integral information. Lower bounds result from the respective bounds for the integration problem.

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

↑