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

广义量子搜索与量子化

Generalized Quantum Search with Parallelism

Robert Gingrich, Colin P. Williams, Nicolas Cerf

摘要:

我们推广了Grover的非结构化量子搜索算法,使其能够同时使用任意的起始叠加和任意的酉矩阵。我们推导出一个精确的公式的概率后n次迭代的广义Grover的算法成功。我们表明,完全广义公式减少到以前的作者考虑的特殊情况。然后,我们使用广义公式来确定使用非结构化量子搜索算法的最佳策略。平均而言,最优策略比Grover算法的朴素使用好约12%。所获得的加速并不显著,但它说明了量子计算和经典计算技术的混合使用可以产生比单独使用更好的性能。我们扩展的情况下,一个社会的k量子搜索并行的分析。我们推导出一个解析公式,连接的并行度与k-并行量子搜索的最佳策略。然后,我们推导出k-并行量子搜索的预期速度的公式。

英文摘要:

We generalize Grover's unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover's algorithm succeeding after n iterations. We show that the fully generalized formula reduces to the special cases considered by previous authors. We then use the generalized formula to determine the optimal strategy for using the unstructured quantum search algorithm. On average the optimal strategy is about 12% better than the naive use of Grover's algorithm. The speedup obtained is not dramatic but it illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. We extend the analysis to the case of a society of k quantum searches acting in parallel. We derive an analytic formula that connects the degree of parallelism with the optimal strategy for k-parallel quantum search. We then derive the formula for the expected speed of k-parallel quantum search.

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

↑