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

量子通信复杂性中的相互作用

Interaction in Quantum Communication Complexity

Ashwin Nayak, Amnon Ta-Shma, David Zuckerman

摘要:

关于使用量子态的通信,最有趣的事实之一是,这些状态不能用来传输比所使用的量子比特数量更多的经典比特,然而,有一些方法可以用比经典可能的数量少成指数级的量子比特来传递信息。此外,这些方法有一个非常简单的结构-他们涉及很少的相互作用之间的沟通当事人。我们更仔细地研究编码在量子态中的信息可以被操纵的方式,并考虑是否每个经典协议都可以转换为具有类似效率的“更简单”的量子协议的问题。简单协议是指使用较少消息交换的协议。我们证明了对于任意常数k,存在一个问题使得它的k+1消息经典通信复杂度指数小于它的k消息量子通信复杂度,从而否定地回答了上述问题.我们的结果建立在两个原语,局部转换在二分状态(基于以前的工作)和平均编码,这可能是在其他应用程序中的意义。

英文摘要:

One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet there are ways of conveying information with exponentially fewer qubits than possible classically. Moreover, these methods have a very simple structure---they involve little interaction between the communicating parties. We look more closely at the ways in which information encoded in quantum states may be manipulated, and consider the question as to whether every classical protocol may be transformed to a ``simpler'' quantum protocol of similar efficiency. By a simpler protocol, we mean a protocol that uses fewer message exchanges. We show that for any constant k, there is a problem such that its k+1 message classical communication complexity is exponentially smaller than its k message quantum communication complexity, thus answering the above question in the negative. Our result builds on two primitives, local transitions in bi-partite states (based on previous work) and average encoding which may be of significance in other applications as well.

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

↑