
arXiv: 1502.02987
We initiate the study of zero-error communication via quantum channels when the receiver and sender have at their disposal a noiseless feedback channel of unlimited quantum capacity, generalizing Shannon's zero-error communication theory with instantaneous feedback. We first show that this capacity is a function only of the linear span of Choi-Kraus operators of the channel, which generalizes the bipartite equivocation graph of a classical channel, and which we dub "non-commutative bipartite graph". Then we go on to show that the feedback-assisted capacity is non-zero (with constant activating noiseless communication) if and only if the non-commutative bipartite graph is non-trivial, and give a number of equivalent characterizations. This result involves a far-reaching extension of the "conclusive exclusion" of quantum states [Pusey/Barrett/Rudolph, Nature Phys. 8:475-478]. We then present an upper bound on the feedback-assisted zero-error capacity, motivated by a conjecture originally made by Shannon and proved later by Ahlswede. We demonstrate this bound to have many good properties, including being additive and given by a minimax formula. We also prove that this quantity is the entanglement-assisted capacity against an adversarially chosen channel from the set of all channels with the same Choi-Kraus span, which can also be interpreted as the feedback-assisted unambiguous capacity. The proof relies on a generalization of the "Postselection Lemma" [Christandl/Koenig/Renner, PRL 102:020504] that allows to reflect additional constraints, and which we believe to be of independent interest. We illustrate our ideas with a number of examples, including classical-quantum channels and Weyl diagonal channels, and close with an extensive discussion of open questions.
34 pages, 1 figure; v2 has improved presentation, numerous typos corrected and many more references; v3 equivalent to final, accepted journal version (IEEE Trans Inf Theory)
FOS: Computer and information sciences, Technology, Entanglement-assisted Capacity, Computer Science - Information Theory, FOS: Physical sciences, Feedback, Engineering, Zero-error Capacity, Reverse Shannon Theorem, FOS: Mathematics, Mathematics - Combinatorics, States, Quantum Physics, Science & Technology, Information Theory (cs.IT), Computer Science, Electrical & Electronic, Quantum Information, Combinatorics (math.CO), Quantum Physics (quant-ph), Classical Capacity, Information Systems
FOS: Computer and information sciences, Technology, Entanglement-assisted Capacity, Computer Science - Information Theory, FOS: Physical sciences, Feedback, Engineering, Zero-error Capacity, Reverse Shannon Theorem, FOS: Mathematics, Mathematics - Combinatorics, States, Quantum Physics, Science & Technology, Information Theory (cs.IT), Computer Science, Electrical & Electronic, Quantum Information, Combinatorics (math.CO), Quantum Physics (quant-ph), Classical Capacity, Information Systems
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
