Simplification of Additivity Conjecture in Quantum Information Theory

2006/08/31 by Motohisa Fukuda · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph

paper · pdf · doi:10.1007/s11128-007-0051-8

published as Quantum Information Processing, Vol. 6, 179-186, (2007) · 8 pages

openalex publication_date 2007/03/14 · arxiv created 2007/04/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

We simplify some conjectures in quantum information theory; the additivity of minimal output entropy, the multiplicativity of maximal output p-norm and the superadditivity of convex closure of output entropy. We construct a unital channel for a given channel so that they share the above additivity properties; we can reduce the conjectures for all channels to those for unital channels.

Citations

• An application of a matrix inequality in quantum information theory
• Additivity of minimal entropy output for a class of covariant channels
• Strong superadditivity of the entanglement of formation follows from its additivity

Cited by

• Simplifying additivity problems using direct sum constructions
• Classical capacity of quantum channels with memory