Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

A Simplification Algorithm for Calculation of the Mutual Information by Quantum Combined Measurement (Special Section on Information Theory and Its Applications)

Shogo Usami, Tsuyoshi Sasaki Usuda, Ichi Takumi, Masayasu Hata

Published Oct 25, 1999• 2 citations
OpenAlex

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.

Related papers

Properties of Quantum Gain of Coding with Information Criterion by Binary Linear Codes

Yuki Ishida, Shogo Usami, Tsuyoshi Sasaki Usuda +1 more

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.

IEEJ Transactions on Electronics Information and Systems•Jan 1, 2006•5 citations

Properties of quantum gain of coding with information criterion by binary linear codes

Yuki Ishida, Shogo Usami, Tsuyoshi Sasaki Usuda +1 more

Abstract In quantum information theory, superadditivity in the capacity of a quantum channel occurs as a special property. We present a method of calculating the mutual information analytically for binary linear codes by using square‐root measurement as the decoding process. Many examples of codes showing the existence of superadditivity in capacity have been given in the past, but the scope of the method was not clarified. In the present paper, we show that the method can be applied to any binary linear codes. We also show that the quantum channel capacity is almost fully attained in a finite codeword length by using approximation to simplex code. © 2008 Wiley Periodicals, Inc. Electr Eng Jpn, 163(4): 48–57, 2008; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20646

Electrical Engineering in Japan•Apr 23, 2008•3 citations

Superadditivity in Capacity of Quantum Channel by Classical Pseudo-Cyclic Codes

Shogo Usami, Tsuyoshi Sasaki Usuda, Ichi Takumi +2 more

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.

Kluwer Academic Publishers eBooks•Feb 24, 2006•0 citations

Implementation of generalized quantum measurements: Superadditive quantum coding, accessible information extraction, and classical capacity limit

Masahiro Takeoka, Mikio Fujiwara, Jun Mizuno +1 more

Quantum-information theory predicts that when the transmission resource is doubled in quantum channels, the amount of information transmitted can be increased more than twice by quantum-channel coding technique, whereas the increase is at most twice in classical information theory. This remarkable feature, the superadditive quantum-coding gain, can be implemented by appropriate choices of code words and corresponding quantum decoding which requires a collective quantum measurement. Recently, an experimental demonstration was reported [M. Fujiwara et al., Phys. Rev. Lett. 90, 167906 (2003)]. The purpose of this paper is to describe our experiment in detail. Particularly, a design strategy of quantum-collective decoding in physical quantum circuits is emphasized. We also address the practical implication of the gain on communication performance by introducing the quantum-classical hybrid coding scheme. We show how the superadditive quantum-coding gain, even in a small code length, can boost the communication performance of conventional coding techniques.

arXiv:quant-ph/0306034•Physical Review A•May 26, 2004•24 citations

Simplification of the Gram Matrix Eigenvalue Problem for Quadrature Amplitude Modulation Signals

Ryusuke Miyazaki, Tiancheng Wang, Tsuyoshi Sasaki Usuda

In quantum information science, it is very important to solve the eigenvalue problem of the Gram matrix for quantum signals. This allows various quantities to be calculated, such as the error probability, mutual information, channel capacity, and the upper and lower bounds of the reliability function. Solving the eigenvalue problem also provides a matrix representation of quantum signals, which is useful for simulating quantum systems. In the case of symmetric signals, analytic solutions to the eigenvalue problem of the Gram matrix have been obtained, and efficient computations are possible. However, for asymmetric signals, there is no analytic solution and universal numerical algorithms that must be used, rendering the computations inefficient. Recently, we have shown that, for asymmetric signals such as amplitude-shift keying coherent-state signals, the Gram matrix eigenvalue problem can be simplified by exploiting its partial symmetry. In this paper, we clarify a method for simplifying the eigenvalue problem of the Gram matrix for quadrature amplitude modulation (QAM) signals, which are extremely important for applications in quantum communication and quantum ciphers. The results presented in this paper are applicable to ordinary QAM signals as well as modified QAM signals, which enhance the security of quantum cryptography.

Entropy•Apr 13, 2022•5 citations

Quantum channels showing superadditivity in classical capacity

Masahide Sasaki, Kentaro Kato, Masayuki Izutsu +1 more

We consider a channel coding for sending classical information through a quantum channel with a given ensemble of quantum states (letter states). As is well known, it is generically possible in a quantum channel that the transmittable information in block coding of length $n$ can exceed $n$ times the maximum amount that can be sent without any coding scheme. This so-called superadditivity in classical capacity of a quantum channel is a distinct feature that cannot be found in a classical memoryless channel. In this paper, a practical model of channel coding that shows this property is presented. It consists of a simple code-word selection and the optimum decoding of the code words minimizing the average error probability. At first, optimization of decoding strategy is discussed. Then the channel coding that shows the superadditivity in classical capacity is demonstrated.

arXiv:quant-ph/9801012•Physical Review A•Jul 1, 1998•134 citations
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.
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.
Abstract In quantum information theory, superadditivity in the capacity of a quantum channel occurs as a special property. We present a method of calculating the mutual information analytically for binary linear codes by using square‐root measurement as the decoding process. Many examples of codes showing the existence of superadditivity in capacity have been given in the past, but the scope of the method was not clarified. In the present paper, we show that the method can be applied to any binary linear codes. We also show that the quantum channel capacity is almost fully attained in a finite codeword length by using approximation to simplex code. © 2008 Wiley Periodicals, Inc. Electr Eng Jpn, 163(4): 48–57, 2008; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20646
Quantum-information theory predicts that when the transmission resource is doubled in quantum channels, the amount of information transmitted can be increased more than twice by quantum-channel coding technique, whereas the increase is at most twice in classical information theory. This remarkable feature, the superadditive quantum-coding gain, can be implemented by appropriate choices of code words and corresponding quantum decoding which requires a collective quantum measurement. Recently, an experimental demonstration was reported [M. Fujiwara et al., Phys. Rev. Lett. 90, 167906 (2003)]. The purpose of this paper is to describe our experiment in detail. Particularly, a design strategy of quantum-collective decoding in physical quantum circuits is emphasized. We also address the practical implication of the gain on communication performance by introducing the quantum-classical hybrid coding scheme. We show how the superadditive quantum-coding gain, even in a small code length, can boost the communication performance of conventional coding techniques.
In quantum information science, it is very important to solve the eigenvalue problem of the Gram matrix for quantum signals. This allows various quantities to be calculated, such as the error probability, mutual information, channel capacity, and the upper and lower bounds of the reliability function. Solving the eigenvalue problem also provides a matrix representation of quantum signals, which is useful for simulating quantum systems. In the case of symmetric signals, analytic solutions to the eigenvalue problem of the Gram matrix have been obtained, and efficient computations are possible. However, for asymmetric signals, there is no analytic solution and universal numerical algorithms that must be used, rendering the computations inefficient. Recently, we have shown that, for asymmetric signals such as amplitude-shift keying coherent-state signals, the Gram matrix eigenvalue problem can be simplified by exploiting its partial symmetry. In this paper, we clarify a method for simplifying the eigenvalue problem of the Gram matrix for quadrature amplitude modulation (QAM) signals, which are extremely important for applications in quantum communication and quantum ciphers. The results presented in this paper are applicable to ordinary QAM signals as well as modified QAM signals, which enhance the security of quantum cryptography.
We consider a channel coding for sending classical information through a quantum channel with a given ensemble of quantum states (letter states). As is well known, it is generically possible in a quantum channel that the transmittable information in block coding of length nnn can exceed nnn times the maximum amount that can be sent without any coding scheme. This so-called superadditivity in classical capacity of a quantum channel is a distinct feature that cannot be found in a classical memoryless channel. In this paper, a practical model of channel coding that shows this property is presented. It consists of a simple code-word selection and the optimum decoding of the code words minimizing the average error probability. At first, optimization of decoding strategy is discussed. Then the channel coding that shows the superadditivity in classical capacity is demonstrated.