A Simplification Algorithm for Calculation of the Mutual Information by Quantum Combined Measurement
-
- USAMI Shogo
- the Department of A.I. & Computer Science, Nagoya Institute of Technology
-
- USUDA Tsuyoshi sasaki
- the Department of A.I. & Computer Science, Nagoya Institute of Technology
-
- TAKUMI Ichi
- the Department of A.I. & Computer Science, Nagoya Institute of Technology
-
- HATA Masayasu
- the Department of Applied Information Technologoy, Aichi Prefectural University
この論文をさがす
抄録
Recently, the quantum information theory attracts much attention. In quantum information theory, the existence of superadditivity in capacity of a quantum channel was foreseen conventionally. So far, some examples of codes which show the superadditivity in capacity have been clarified. However in present stage, characteristics of superadditivity are not still clear up enough. The reason is as follows. All examples were shown by calculating the mutual information by quantum combined measurement, so that one had to solve the eigenvalue and the eigenvector problems. In this paper, we construct a simplification algorithm to calculate the mutual information by using square-root measurement as decoding process of quantum combined measurement. The eigenvalue and the eigenvector problems are avoided in the algorithm by using group covariancy of binary linear codes. Moreover, we derive the analytical solution of the mutual information for parity check codes with any length as an example of applying the simplification algorithm.
収録刊行物
-
- IEICE transactions on fundamentals of electronics, communications and computer sciences
-
IEICE transactions on fundamentals of electronics, communications and computer sciences 82 (10), 2185-2190, 1999-10-25
一般社団法人電子情報通信学会
- Tweet
キーワード
詳細情報
-
- CRID
- 1573105977194253952
-
- NII論文ID
- 110003208149
-
- NII書誌ID
- AA10826239
-
- ISSN
- 09168508
-
- Web Site
- http://id.nii.ac.jp/1476/00004743/
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles