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

量子复杂性中的多项式次数和下界:碰撞和小范围元素的区别

Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range

Andris Ambainis

摘要:

给出了小值域问题的量子下界的一般证明方法。也就是说,我们表明,对于任何对称问题定义的功能$f:\{1, ..., N\}\to\{1, ..., M\}$,它的多项式次数是相同的所有$M\geq N$。因此,如果我们有一个量子下限的一些(可能,相当大的)范围$M$这是使用多项式的方法,我们立即得到相同的下限的所有范围$M\geq N$。特别地,我们得到了小范围内碰撞和元素区分的$Ω(N^{1/3})$和$Ω(N^{2/3})$量子下界.

英文摘要:

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all $M\geq N$. Therefore, if we have a quantum lower bound for some (possibly, quite large) range $M$ which is shown using polynomials method, we immediately get the same lower bound for all ranges $M\geq N$. In particular, we get $Ω(N^{1/3})$ and $Ω(N^{2/3})$ quantum lower bounds for collision and element distinctness with small range.

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

↑