关于小值域爪函数的一个注记
A note about claw function with a small range
摘要:
在爪检测问题中,我们给出了两个函数$f:D\rightarrow R$和$g:D\rightarrow R$($|D|=n$,$|R|=k$),我们需要判断是否存在$x,y\in D$使得$f(x)=g(y)$ .我们表明,这个问题的量子查询复杂性是$Ω\left(n^{1/2}k^{1/6}\right)$和$O\left(n^{1/2+\varepsilon}k^{1/4}\right)$之间的$2\leq k<n$。
英文摘要:
In the claw detection problem we are given two functions $f:D\rightarrow R$ and $g:D\rightarrow R$ ($|D|=n$, $|R|=k$), and we have to determine if there is exist $x,y\in D$ such that $f(x)=g(y)$. We show that the quantum query complexity of this problem is between $Ω\left(n^{1/2}k^{1/6}\right)$ and $O\left(n^{1/2+\varepsilon}k^{1/4}\right)$ when $2\leq k<n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。