单向和SMP模型中对称XOR函数随机通信复杂性的紧界
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models
摘要:
本文研究了对称异或函数的通信复杂性,即函数$f: \{0,1\}^n \times \{0,1\}^n \rightarrow \{0,1\}$对于某个谓词$D: \{0,1,...,n\} \rightarrow \{0,1\}$可表示为$f(x,y)=D(|x\oplus y|)$,其中$|x\oplus y|$是$x$和$y$按位异或的汉明重量.在同时消息传递(SMP)模型下,给出了一个公共币随机协议,其通信代价与\emph{quantum}和\emph{two-way}模型的已知下界在一个对数因子上匹配.作为一个推论,这关闭了单向模型的量子下限和随机上限之间的二次差距,回答了Shi和Zhang \cite{SZ09}提出的一个开放问题。
英文摘要:
We study the communication complexity of symmetric XOR functions, namely functions $f: \{0,1\}^n \times \{0,1\}^n \rightarrow \{0,1\}$ that can be formulated as $f(x,y)=D(|x\oplus y|)$ for some predicate $D: \{0,1,...,n\} \rightarrow \{0,1\}$, where $|x\oplus y|$ is the Hamming weight of the bitwise XOR of $x$ and $y$. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP) model, with the communication cost matching the known lower bound for the \emph{quantum} and \emph{two-way} model up to a logarithm factor. As a corollary, this closes a quadratic gap between quantum lower bound and randomized upper bound for the one-way model, answering an open question raised in Shi and Zhang \cite{SZ09}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。