Simplifying additivity problems using direct sum constructions

DOI10.1063/1.2746128MaRDI QIDQ3529786zbMATH OpenOpenAlexFDO

Authors Motohisa Fukuda, Michael M. Wolf

Publication date 14 October 2008

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0704.1092

Mathematics Subject Classification ID

Quantum computation (81P68) Applications of operator theory in the physical sciences (47N50) Quantum stochastic calculus (81S25) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We study the additivity problems for the classical capacity of quantum channels, the minimal output entropy and its convex closure. We show for each of them that additivity for arbitrary pairs of channels holds iff it holds for arbitrary equal pairs, which in turn can be taken to be unital. In a similar sense, weak additivity is shown to imply strong additivity for any convex entanglement monotone. The implications are obtained by considering direct sums of channels (or states) for which we show how to obtain several information theoretic quantities from their values on the summands. This provides a simple and general tool for lifting additivity results.

Recommendations

• The additivity problem for constrained quantum channels
• Equivalence of additivity questions in quantum information theory
• Additivity for unital qubit channels
• Simplification of additivity conjecture in quantum information theory
• Additivity of the classical capacity of entanglement-breaking quantum channels

Cites work

• A Mathematical Theory of Communication
• Additivity for unital qubit channels
• Additivity of the classical capacity of entanglement-breaking quantum channels
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Equivalence of additivity questions in quantum information theory
• Erratum: Inequalities for quantum entropy: A review with conditions for equality [J. Math. Phys. 43, 4358 (2002)]
• Minimal entropy of states emerging from noisy quantum channels
• Mixed-state entanglement and quantum error correction
• On strong superadditivity of the entanglement of formation
• Remarks on additivity of the Holevo channel capacity and of the entanglement of formation
• Simplification of additivity conjecture in quantum information theory
• Simplifying Monotonicity Conditions for Entanglement Measures
• The asymptotic entanglement cost of preparing a quantum state
• The capacity of the quantum channel with general signal states
• The capacity of the quantum depolarizing channel

Cited in

(17)

• Additivity and distinguishability of random unitary channels
• Towards a state minimizing the output entropy of a tensor product of random quantum channels
• Counting atypical black hole microstates from entanglement wedges
• An Addition Strategy for Reduct Construction
• Unital quantum channels - convex structure and revivals of Birkhoff's theorem
• The structure of degradable quantum channels
• Equivalence of additivity questions in quantum information theory
• Comments on Hastings' additivity counterexamples
• Gaussian optimizers and the additivity problem in quantum information theory
• scientific article; zbMATH DE number 3166303 (Why is no real title available?)
• Entanglement of random subspaces via the Hastings bound
• Revisiting additivity violation of quantum channels
• Simplification of additivity conjecture in quantum information theory
• Quantum entanglement
• Capacity estimates via comparison with TRO channels
• On Hastings' counterexamples to the minimum output entropy additivity conjecture
• Capacity bounds via operator space methods

This page was built for publication: Simplifying additivity problems using direct sum constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529786)