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

量子通信的Renyi熵界

Renyi-entropic bounds on quantum communication

Wim van Dam, Patrick Hayden

摘要:

在这篇文章中,我们建立了分布式问题的量子通信复杂性的新界限。具体来说,我们考虑了将一个二分态转换为另一个通常更纠缠的状态所需的通信量。通过研究分布式系统的边缘密度矩阵的Renyi熵,得到了该系统的下界。量子态变换的通信边界也意味着通信复杂度模型的下界,其中任务由函数f(x,y)的分布式求值组成。我们的方法封装了几个已知的下界方法,使用对数秩或冯诺伊曼熵的密度矩阵。该技术也是有效的证明下界的问题,涉及的承诺或“硬”分布的输入相关。作为例子,我们展示了如何证明一个几乎紧界的有界错误量子通信复杂性的内积功能的EPR型纠缠和类似的强界的复杂性的移位二次特征问题的存在下,无限数量的。

英文摘要:

In this article we establish new bounds on the quantum communication complexity of distributed problems. Specifically, we consider the amount of communication that is required to transform a bipartite state into another, typically more entangled, state. We obtain lower bounds in this setting by studying the Renyi entropy of the marginal density matrices of the distributed system. The communication bounds on quantum state transformations also imply lower bounds for the model of communication complexity where the task consists of the the distributed evaluation of a function f(x,y). Our approach encapsulates several known lower bound methods that use the log-rank or the von Neumann entropy of the density matrices involved. The technique is also effective for proving lower bounds on problems involving a promise or for which the "hard" distributions of inputs are correlated. As examples, we show how to prove a nearly tight bound on the bounded-error quantum communication complexity of the inner product function in the presence of unlimited amounts of EPR-type entanglement and a similarly strong bound on the complexity of the shifted quadratic character problem.

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

↑