Properties of Quantum Gain of Coding with Information Criterion by Binary Linear Codes
Yuki Ishida, Shogo Usami, Tsuyoshi Sasaki Usuda, Ichi Takumi · IEEJ Transactions on Electronics Information and Systems · 2006
In quantum information theory, there is superadditivity in capacity of a quantum channel as special property. We showed the calculating method of mutual information analytically for binary linear codes by using Square-root measurement as decoding process. Therefore, many examples of codes which shows existence of superadditivity in capacity have been given. But the scope of method was not clarified. In the present paper, we show the method can be applied to any binary linear codes. Moreover, we show quantum channel capacity is almost attained in finite codeword length by using approximation to simplex code.