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

量子通信无法模拟公共硬币

Quantum Communication Cannot Simulate a Public Coin

Dmytro Gavinsky, Julia Kempe, Ronald de Wolf

摘要:

研究了通信复杂性的同时消息传递模型。基于Buhrman等人的量子指纹协议,Yao最近表明,一大类有效的经典公共币协议可以在没有公共币的情况下转化为有效的量子协议。这就提出了一个问题,即量子通信是否总是可以取代SMP模型中的公共硬币。我们对这个问题的回答是否定的,展示了一个通信问题,其中使用公共硬币的经典通信比量子通信效率高出指数级。连同由于Bar-Yossef等人而在另一个方向上的分离,这表明量子SMP模型与经典的公共硬币SMP模型是不可比较的。此外,我们还通过与机器学习中的几何工具的连接、对姚明模拟的二次改进以及对姚明论文中的海明距离问题的近乎严格的分析,给出了量子指纹识别能力的表征。

英文摘要:

We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large class of efficient classical public-coin protocols can be turned into efficient quantum protocols without public coin. This raises the question whether this can be done always, i.e. whether quantum communication can always replace a public coin in the SMP model. We answer this question in the negative, exhibiting a communication problem where classical communication with public coin is exponentially more efficient than quantum communication. Together with a separation in the other direction due to Bar-Yossef et al., this shows that the quantum SMP model is incomparable with the classical public-coin SMP model. In addition we give a characterization of the power of quantum fingerprinting by means of a connection to geometrical tools from machine learning, a quadratic improvement of Yao's simulation, and a nearly tight analysis of the Hamming distance problem from Yao's paper.

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

↑