Superadditivity in capacity of quantum channel by classical pseudo-cyclic codes

被引:0
|
作者
Usami, S [1 ]
Usuda, TS [1 ]
Takumi, I [1 ]
Nakano, R [1 ]
Hata, M [1 ]
机构
[1] Nagoya Inst Technol, Dept AI, Showa Ku, Nagoya, Aichi 4668555, Japan
关键词
channel capacity; superadditivity; mutual information; square-root measurement;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Analytical solution of mutual information by square-root measurement for binary linear code is given. Applying the solution, we show properties of superadditivity in capacity by BCH codes with codeword length 15 and 31. Furthermore, we refer to codes almost achieving the quantum channel capacity.
引用
收藏
页码:35 / 38
页数:4
相关论文
共 50 条