Equivalence of Additivity Questions in Quantum Information Theory
classification
🪐 quant-ph
math-phmath.MP
keywords
additivityquantumchannelentanglementformationinformationtheorycapacity
read the original abstract
We reduce the number of open additivity problems in quantum information theory by showing that four of them are equivalent. We show that the conjectures of additivity of the minimum output entropy of a quantum channel, additivity of the Holevo expression for the classical capacity of a quantum channel, additivity of the entanglement of formation, and strong superadditivity of the entanglement of formation, are either all true or all false.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.