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

International Symposium on Information Theory and its Applications

Applying a symmetrization method by coding to non-symmetric mixed-state signals

Souichi Takahira, Tsuyoshi Sasaki Usuda

Published Oct 1, 2018• 0 citations
Publisher

Abstract

In quantum communication theory, group covariant signals are important and useful when we consider the minimization problem of the error probability or the maximization problem of the mutual information. However, in practical applications, there are important non-symmetric signals such as amplitude shift keying or quadrature amplitude modulation signals. To manage this situation, we have proposed a symmetrization method of non-symmetric pure-state signals by using coding. In this paper, we consider to apply the symmetrization method to mixed-state signals and give a necessary condition of mixed-state signals to apply the method. Then, we present examples of mixed-state signals to which the symmetrization method can be applied.

DOI
10.23919/isita.2018.8664216

Related papers

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

The maximum mutual information without coding for binary quantum-state signals

Masao Osaki, Osamu Hirota, Masashi Ban

The maximum mutual information without coding is investigated for binary quantum-state signals. The necessary condition for detection operators to represent the information optimal detection is satisfied for M-ary symmetric quantum-state signals by the detection operators derived from the quantum minimax strategy while its purpose is a minimization of the error probability. The true maximum mutual information is numerically analysed for the binary case.

Journal of Modern Optics•Feb 1, 1998•19 citations

Relationship between optimum quantum detection operators for pure and mixed‐state signals

Yuji Fujihara, Tsuyoshi Sasaki Usuda, Ichi Takumi +1 more

Abstract A significant issue at present in the field of quantum information theory is the implementation of an optimum quantum receiver in which the error probability is minimized. Because a quantum receiver is represented by detection operators, in order to implement an optimum quantum receiver, it is important to derive optimum detection operators that minimize the error probability. Although it is generally difficult to analytically derive such a detection operator, optimum detection operators have been obtained on several specific signal systems in which signals are in the pure state. On the other hand, because mixed‐state signals are associated with more general signals, including classical noise, it is more important to address mixed‐state signals. However, for these signals, only basic optimum detection operators, such as binary signals in a two‐dimensional system and M‐ary symmetric signals, have been obtained. Regarding these optimum detection operators, it has been suggested that optimum detection operators for pure‐state signals can also be a reasonably good signal detection process for mixed‐state signals. Based on this suggestion, this paper examines the extent to which the optimum detection operators for pure‐state signals can be applied to mixed‐state signals. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 86(10): 8–18, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecjc.1153

Electronics and Communications in Japan (Part III Fundamental Electronic Science)•Apr 14, 2003•6 citations

Quantum detection of coherent-state signals in the presence of noise

Victor A. Vilnrotter, Chi-Wung Lau

A general method for solving an important class of quantum detection problems will be presented and evaluated. The quantum theory for detecting pure states for communications purposes has been developed over two decades ago, however the mixed state problem representing signal plus noise states has received little attention due to its great complexity. Here we develop a practical model for solving the mixed-state problem using a discrete approximation to the coherent-state representation of signal plus noise density operators.

•Jan 21, 2003•0 citations

Constructing non-binary asymmetric quantum codes via graphs

Zhi Ma, Leng Riguang, Zhengchao Wei +1 more

The theory of quantum error correcting codes is a primary tool for fighting decoherence and other quantum noise in quantum communication and quantum computation. Recently, the theory of quantum error correcting codes has developed rapidly and been extended to protect quantum information over asymmetric quantum channels, in which phase-shift and qubit-flip errors occur with different probabilities. In this paper, we generalize the construction of symmetric quantum codes via graphs (or matrices) to the asymmetric case, converting the construction of asymmetric quantum codes to finding matrices with some special properties. We also propose some asymmetric quantum Maximal Distance Separable (MDS) codes as examples constructed in this way.

China Communications•Feb 1, 2013•1 citation

Optimal signal detection in entanglement-assisted quantum communication systems

Masashi Ban

Minimization of error probability is considered in entanglement-assisted quantum communication systems. It is shown that although quantum state signals being sent are not symmetric at a sender side, the square root measurement becomes optimum when they are made symmetric at the receiver side. For communication systems of coherent signals, where a two-mode squeezed-vacuum state is used as an entanglement resource, the quantum entanglement greatly reduces the average probability of error. The relation to the quantum dense coding of continuous variables is also discussed.

Journal of Optics B Quantum and Semiclassical Optics•Mar 1, 2002•4 citations
In quantum communication theory, group covariant signals are important and useful when we consider the minimization problem of the error probability or the maximization problem of the mutual information. However, in practical applications, there are important non-symmetric signals such as amplitude shift keying or quadrature amplitude modulation signals. To manage this situation, we have proposed a symmetrization method of non-symmetric pure-state signals by using coding. In this paper, we consider to apply the symmetrization method to mixed-state signals and give a necessary condition of mixed-state signals to apply the method. Then, we present examples of mixed-state signals to which the symmetrization method can be applied.
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.
Abstract A significant issue at present in the field of quantum information theory is the implementation of an optimum quantum receiver in which the error probability is minimized. Because a quantum receiver is represented by detection operators, in order to implement an optimum quantum receiver, it is important to derive optimum detection operators that minimize the error probability. Although it is generally difficult to analytically derive such a detection operator, optimum detection operators have been obtained on several specific signal systems in which signals are in the pure state. On the other hand, because mixed‐state signals are associated with more general signals, including classical noise, it is more important to address mixed‐state signals. However, for these signals, only basic optimum detection operators, such as binary signals in a two‐dimensional system and M‐ary symmetric signals, have been obtained. Regarding these optimum detection operators, it has been suggested that optimum detection operators for pure‐state signals can also be a reasonably good signal detection process for mixed‐state signals. Based on this suggestion, this paper examines the extent to which the optimum detection operators for pure‐state signals can be applied to mixed‐state signals. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 86(10): 8–18, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecjc.1153
A general method for solving an important class of quantum detection problems will be presented and evaluated. The quantum theory for detecting pure states for communications purposes has been developed over two decades ago, however the mixed state problem representing signal plus noise states has received little attention due to its great complexity. Here we develop a practical model for solving the mixed-state problem using a discrete approximation to the coherent-state representation of signal plus noise density operators.
The theory of quantum error correcting codes is a primary tool for fighting decoherence and other quantum noise in quantum communication and quantum computation. Recently, the theory of quantum error correcting codes has developed rapidly and been extended to protect quantum information over asymmetric quantum channels, in which phase-shift and qubit-flip errors occur with different probabilities. In this paper, we generalize the construction of symmetric quantum codes via graphs (or matrices) to the asymmetric case, converting the construction of asymmetric quantum codes to finding matrices with some special properties. We also propose some asymmetric quantum Maximal Distance Separable (MDS) codes as examples constructed in this way.
Minimization of error probability is considered in entanglement-assisted quantum communication systems. It is shown that although quantum state signals being sent are not symmetric at a sender side, the square root measurement becomes optimum when they are made symmetric at the receiver side. For communication systems of coherent signals, where a two-mode squeezed-vacuum state is used as an entanglement resource, the quantum entanglement greatly reduces the average probability of error. The relation to the quantum dense coding of continuous variables is also discussed.