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

结构化搜索问题的量子力学平方根加速

Quantum Mechanical Square Root Speedup in a Structured Search Problem

Edward Farhi, Sam Gutmann

摘要:

对N中的一个项的非结构化搜索可以在N的阶平方根的时间内量子力学地执行,而经典地这需要N阶步骤。这就提出了一个问题,即平方根加速是否在结构更复杂的问题中持续存在。在这篇文章中,我们专注于一个结构化问题的例子,并找到一个量子算法,它需要的时间为经典时间的平方根。

英文摘要:

An unstructured search for one item out of N can be performed quantum mechanically in time of order square root of N whereas classically this requires of order N steps. This raises the question of whether square root speedup persists in problems with more structure. In this note we focus on one example of a structured problem and find a quantum algorithm which takes time of order the square root of the classical time.

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

↑