Yet another additivity conjecture

被引:2
|
作者
Matsumoto, K
机构
[1] ERATO, Quantum Computat & Informat Project, JST, Bunkyo Ku, Tokyo 1130033, Japan
[2] Natl Inst Informat, Quantum Informat Sci Grp, Chiyoda Ku, Tokyo 1018430, Japan
关键词
D O I
10.1016/j.physleta.2005.10.028
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
In quantum information theory, there are several important open problems which center around whether certain quantities are additive or not. Especially, additivity conjecture about Holevo capacity and additivity/strong superadditivity conjecture about entanglement of formation have been attracting many researchers. It recently turned out that these are equivalent to the additivity of the minimum output entropy of quantum channels, which is mathematically simpler. This Letter suggests yet another additivity conjecture which is equivalent to those, and is mathematically simple. This conjecture might be easier than other conjectures to solve, for this can be proven for almost all the examples where one of these conjectures are proven. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:179 / 181
页数:3
相关论文
共 50 条