arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0807.1267cs.DCcs.ITmath.IT
收藏

量子与经典通信复杂性的最优直和与隐私折衷结果

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan

摘要:

我们给出了单向纠缠辅助的量子通信复杂性的最优直和结果。我们展示:Q^{1,pub}(f^m)= Omega(m Q^{1,pub}(f)),其中Q^{1,pub}(f)表示f的单向纠缠辅助的量子通信复杂性,误差至多为1/3,f^m表示f的m个副本。类似地,对于单向公共硬币经典通信复杂性,我们证明:R^{1,pub}(f^m)= Omega(m R^{1,pub}(f)),其中R^{1,pub}(f)表示f的单向公共硬币经典通信复杂性,误差至多为1/3。我们表现出类似的最佳直接和结果的同时消息传递量子和经典模型。对于双向协议,我们提出了最佳的隐私权衡的结果,导致这样的协议的弱直和结果。我们通过消息压缩参数展示了我们的直和和隐私权衡结果,这也意味着量子通信中的一个新的轮消引理。这使我们能够扩展经典的下限上的一些数据结构问题的细胞探测复杂性,例如,近似最近邻搜索的汉明立方体{0,1}^n和前身搜索量子设置。在一个单独的结果中,我们证明了纽曼在经典协议中减少公共硬币数量的技术不能被提升到量子设置。我们这样做,通过定义一个一般概念的黑箱减少先前的纠缠,包括纽曼的技术。我们证明了这种黑箱约简对于量子协议是不可能的。在消息压缩主题的最终结果中,我们提供了精确远程状态准备问题的上界。

英文摘要:

We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f subset of X x Y x Z. We show: Q^{1,pub}(f^m) = Omega(m Q^{1,pub}(f)), where Q^{1,pub}(f), represents the one-way entanglement-assisted quantum communication complexity of f with error at most 1/3 and f^m represents m-copies of f. Similarly for the one-way public-coin classical communication complexity we show: R^{1,pub}(f^m) = Omega(m R^{1,pub}(f)), where R^{1,pub}(f), represents the one-way public-coin classical communication complexity of f with error at most 1/3. We show similar optimal Direct Sum results for the Simultaneous Message Passing quantum and classical models. For two-way protocols we present optimal Privacy Trade-off results leading to a Weak Direct Sum result for such protocols. We show our Direct Sum and Privacy Trade-off results via message compression arguments which also imply a new round elimination lemma in quantum communication. This allows us to extend classical lower bounds on the cell probe complexity of some data structure problems, e.g. Approximate Nearest Neighbor Searching on the Hamming cube {0,1}^n and Predecessor Search to the quantum setting. In a separate result we show that Newman's technique of reducing the number of public-coins in a classical protocol cannot be lifted to the quantum setting. We do this by defining a general notion of black-box reduction of prior entanglement that subsumes Newman's technique. We prove that such a black-box reduction is impossible for quantum protocols. In the final result in the theme of message compression, we provide an upper bound on the problem of Exact Remote State Preparation.

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

↑