一种新的量子下界方法及其在强直积定理中的应用
A new quantum lower bound method, with an application to strong direct product theorem for quantum search
摘要：
我们提出了一种新的方法来证明量子查询算法的下界。通过分析问题的特征空间结构，提出了一种改进的对抗法。利用这种新方法，我们证明了量子搜索的一个强直积定理。这一结果先前由Klauck、Spalek和de Wolf（quant-ph/0402123）使用多项式方法证明。以前没有使用对抗方法的证明。
英文摘要：
We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem. Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proven by Klauck, Spalek and de Wolf (quant-ph/0402123) using polynomials method. No proof using adversary method was known before.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
