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

一般概率论中信道的通信复杂性

Communication Complexity of Channels in General Probabilistic Theories

A. Montina, M. Pfaffhauser, S. Wolf

摘要:

量子信道的通信复杂度是经典地模拟量子态的准备、通过信道的传输和随后的测量的过程所需的最小量的经典通信。目前,对这一数量所知甚少。在本文中,我们提出了一个程序,系统地评估在任何一般的概率理论,特别是量子理论的信道的通信复杂性。该过程是建设性的,并提供了最有效的经典协议。我们说明了这一过程,通过评估的通信复杂性的量子去极化信道与一些有限集的量子态和测量。

英文摘要:

The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum state. At present, only little is known about this quantity. In this paper, we present a procedure for systematically evaluating the communication complexity of channels in any general probabilistic theory, in particular quantum theory. The procedure is constructive and provides the most efficient classical protocols. We illustrate this procedure by evaluating the communication complexity of a quantum depolarizing channel with some finite sets of quantum states and measurements.

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

↑