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

量子相位估计的一个下界

A Lower Bound for Quantum Phase Estimation

Arvid J. Bessen

摘要:

我们得到了量子算法解决相位估计问题的查询下界。我们的分析将现有的下界方法推广到预言Q由Q的受控幂Q^p给出的情况,例如在Shor的找序算法中。在这种情况下,我们将证明Q^p1,Q^p2,.的应用次数的log(1/n)下界。由于存在一个匹配的上界,因此该上界是紧的。我们得到的下界使用一种新的技术的基础上的频率分析。

英文摘要:

We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower bound approaches to the case where the oracle Q is given by controlled powers Q^p of Q, as it is for example in Shor's order finding algorithm. In this setting we will prove a log (1/epsilon) lower bound for the number of applications of Q^p1, Q^p2, ... This bound is tight due to a matching upper bound. We obtain the lower bound using a new technique based on frequency analysis.

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

↑