Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Simplification of Additivity Conjecture in Quantum Information Theory

Simplification of Additivity Conjecture in Quantum Information Theory 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. In this paper, by using some unital extension of quantum channels, we show that proving one of these conjectures for all unital quantum channels would imply that it is also true for all quantum channels. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Simplification of Additivity Conjecture in Quantum Information Theory

Quantum Information Processing , Volume 6 (3) – Mar 15, 2007

Loading next page...
1
 
/lp/springer_journal/simplification-of-additivity-conjecture-in-quantum-information-theory-aokQH4Ii3J

References (23)

Publisher
Springer Journals
Copyright
Copyright © 2007 by Springer Science+Business Media, LLC
Subject
Physics; Characterization and Evaluation of Materials; Computer Science, general ; Engineering, general; Mathematics, general; Physics, general
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-007-0051-8
Publisher site
See Article on Publisher Site

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. In this paper, by using some unital extension of quantum channels, we show that proving one of these conjectures for all unital quantum channels would imply that it is also true for all quantum channels.

Journal

Quantum Information ProcessingSpringer Journals

Published: Mar 15, 2007

There are no references for this article.