2014/03/31 by Teresa Piovesan, Giannicola Scarpa, Christian Schaffner
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Algorithm #Coding (social sciences) #Computer science #Error Correcting Code Techniques #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum entanglement #Quantum mechanics #Statistics #Theoretical computer science #Zero (linguistics) #graph theory and CDMA systems #quant-ph
paper · pdf · doi:10.1109/tit.2014.2379273
published as IEEE Transactions on Information Theory, vol 61, no 2, pp 1113-1123, 2015 · Some proofs have been modified
arxiv created 2014/09/19 · openalex publication_date 2014/12/10 · arxiv updated 2015/01/21 · openalex created_date 2020/11/23 · openalex updated_date 2026/08/05
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicate a common message to multiple receivers. We show that if the number of receivers is greater than a certain threshold then entanglement does not allow for an improvement in the communication for any finite number of uses of the channel. On the other hand, when the number of receivers is fixed, we exhibit a class of channels for which entanglement gives an advantage. The second problem we consider features multiple collaborating senders and one receiver. Classically, cooperation among the senders might allow them to communicate on average more messages than the sum of their individual possibilities. We show that whenever a channel allows single-sender entanglement-assisted advantage, then the gain extends also to the multisender case. Furthermore, we show that entanglement allows for a peculiar amplification of information which cannot happen classically, for a fixed number of uses of the channels.