The search functionality is under construction.

The search functionality is under construction.

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.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.10 pp.2185-2190

- Publication Date
- 1999/10/25

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)

- Category
- Quantum Information

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Shogo USAMI, Tsuyoshi Sasaki USUDA, Ichi TAKUMI, Masayasu HATA, "A Simplification Algorithm for Calculation of the Mutual Information by Quantum Combined Measurement" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 10, pp. 2185-2190, October 1999, doi: .

Abstract: 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.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_10_2185/_p

Copy

@ARTICLE{e82-a_10_2185,

author={Shogo USAMI, Tsuyoshi Sasaki USUDA, Ichi TAKUMI, Masayasu HATA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={A Simplification Algorithm for Calculation of the Mutual Information by Quantum Combined Measurement},

year={1999},

volume={E82-A},

number={10},

pages={2185-2190},

abstract={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.},

keywords={},

doi={},

ISSN={},

month={October},}

Copy

TY - JOUR

TI - A Simplification Algorithm for Calculation of the Mutual Information by Quantum Combined Measurement

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 2185

EP - 2190

AU - Shogo USAMI

AU - Tsuyoshi Sasaki USUDA

AU - Ichi TAKUMI

AU - Masayasu HATA

PY - 1999

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E82-A

IS - 10

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - October 1999

AB - 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.

ER -