Sufficient conditions for additivity of the zero-error classical capacity of quantum channels
Jeonghoon Park, Jeong San Kim

TL;DR
This paper investigates the conditions under which the zero-error classical capacity of quantum channels is additive, focusing on the independence number of noncommutative graphs and providing explicit examples and conditions for multiplicativity.
Contribution
The paper establishes sufficient conditions for the multiplicativity of the independence number of noncommutative graphs, advancing understanding of zero-error quantum channel capacities.
Findings
Identified sufficient conditions for independence number multiplicativity.
Provided explicit examples of quantum channels with multiplicative independence numbers.
Analyzed block forms of noncommutative graphs to determine conditions for additivity.
Abstract
The one-shot zero-error classical capacity of a quantum channel is the amount of classical information that can be transmitted with zero probability of error by a single use. Then the one-shot zero-error classical capacity equals to the logarithmic value of the independence number of the noncommutative graph induced by the channel. Thus the additivity of the one-shot zero-error classical capacity of a quantum channel is equivalent to the multiplicativity of the independence number of the noncommutative graph. The independence number is not multiplicative in general, and it is not clearly understood when the multiplicativity occurs. In this work, we present sufficient conditions for multiplicativity of the independence number, and we give explicit examples of quantum channels. Furthermore, we consider a block form of noncommutative graphs, and provide conditions when the independence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
