On the multiplicativity conjecture for quantum channels
G. G. Amosov, A. S. Holevo

TL;DR
This paper formulates a multiplicativity conjecture for quantum channels, linking it to the additivity problem of channel capacity, and proves it for natural number values of parameter p.
Contribution
It introduces a new multiplicativity conjecture in quantum information theory and provides a proof for natural number parameters, advancing understanding of quantum channel capacities.
Findings
Conjecture formulated for quantum channels.
Proof provided for natural number p.
Connection established with channel capacity additivity.
Abstract
A multiplicativity conjecture for quantum communication channels is formulated, validity of which for the values of parameter close to 1 is related to the solution of the fundamental problem of additivity of the channel capacity in quantum information theory. The proof of the conjecture is given for the case of natural numbers .
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
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
