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

量子加速对结构的需求

The Need for Structure in Quantum Speedups

Scott Aaronson, Andris Ambainis

摘要:

有没有一个普遍的定理告诉我们,什么时候我们可以希望量子算法的加速达到指数级,什么时候我们不能?在本文中,我们在大多数量子算法运行的黑箱模型中对这样一个定理进行了两个改进。首先,我们证明了对于任何在置换输入和输出下不变的问题(如碰撞或元素独特性问题),量子查询复杂度至少是经典随机查询复杂度的7次方根。(An这篇文章的早期版本给出了9次根。这解决了Watrous在2002年提出的一个猜想。其次,受O 'Donnell et al.(2005)和Dinur et al.(2006)最近工作的启发,我们猜想每个有界低次多项式都有一个“高度影响”的变量。假设这个猜想,我们证明了每个T-查询量子算法都可以通过poly(T)-查询经典算法在大多数输入上进行模拟,并且基本上不能希望证明P!相对于随机预言机的BQP。

英文摘要:

Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms operate. First, we show that for any problem that is invariant under permuting inputs and outputs (like the collision or the element distinctness problems), the quantum query complexity is at least the 7th root of the classical randomized query complexity. (An earlier version of this paper gave the 9th root.) This resolves a conjecture of Watrous from 2002. Second, inspired by recent work of O'Donnell et al. (2005) and Dinur et al. (2006), we conjecture that every bounded low-degree polynomial has a "highly influential" variable. Assuming this conjecture, we show that every T-query quantum algorithm can be simulated on most inputs by a poly(T)-query classical algorithm, and that one essentially cannot hope to prove P!=BQP relative to a random oracle.

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

↑