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

对称谓词的量子通信复杂性

Quantum communication complexity of symmetric predicates

Alexander Razborov

摘要:

我们完全(也就是说,直到对数因子)表征每个谓词$f(x,y)$仅依赖于$|x\cap y|$($x,y\subseteq [n]$)的有界错误量子通信复杂性。即,对于$\{0,1,...,n\}$上的同品种$D$,设为$\ell_0(D)\df \max\{\ell : 1\leq\ell\leq n/2\land D(\ell)\not\equiv D(\ell-1)\}$和$\ell_1(D)\df \max\{n-\ell : n/2\leq\ell < n\land D(\ell)\not\equiv D(\ell+1)\}$。然后,$f_D(x,y) = D(|x\cap y|)$的有界误差量子通信复杂度等于(再次,直到对数因子)$\sqrt{n\ell_0(D)}+\ell_1(D)$。特别是,集合不相交性谓词的复杂度为$Ω(\sqrt n)$。这个结果在有和没有纠缠的模型中都成立。

英文摘要:

We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of every predicate $f(x,y)$ depending only on $|x\cap y|$ ($x,y\subseteq [n]$). Namely, for a predicate $D$ on $\{0,1,...,n\}$ let $\ell_0(D)\df \max\{\ell : 1\leq\ell\leq n/2\land D(\ell)\not\equiv D(\ell-1)\}$ and $\ell_1(D)\df \max\{n-\ell : n/2\leq\ell < n\land D(\ell)\not\equiv D(\ell+1)\}$. Then the bounded-error quantum communication complexity of $f_D(x,y) = D(|x\cap y|)$ is equal (again, up to a logarithmic factor) to $\sqrt{n\ell_0(D)}+\ell_1(D)$. In particular, the complexity of the set disjointness predicate is $Ω(\sqrt n)$. This result holds both in the model with prior entanglement and without it.

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

↑