Analytical algorithm for capacities of classical and classical-quantum channels

Hayashi，Masahito

2022

10.1109/TIT.2022.3215178

IEEE TRANSACTIONS ON INFORMATION THEORY   Impact Factor & Quartile

0018-9448

1557-9654

We derive an analytical algorithm for the channel capacity of a classical channel without any iteration, while its existing algorithms require iterations and the number of iterations depends on the required precision level. Hence, our algorithm is its first analytical algorithm for this task without any iteration, while this algorithm needs several conditions for the channel. We apply the obtained algorithm to examples, and see how the obtained algorithm works in these examples. Then, we extend it to the channel capacity of a classical-quantum (cq-) channel. Many existing studies proposed algorithms for a cq-channel and all of them require iterations. Our extended analytical algorithm has also no iteration, and outputs the exactly optimum value.

analytical algorithm Approximation algorithms channel capacity Channel capacity classical-quantum channel Complexity theory Iterative algorithms Mathematical models maximization mutual information STEM Upper bound

English

First

COMPUTER SCIENCE

2-s2.0-85140787023

Scopus

Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology, Nanshan District, Shenzhen, China

Hayashi，Masahito. Analytical algorithm for capacities of classical and classical-quantum channels[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2022,PP(99):1-1.

Hayashi，Masahito.(2022).Analytical algorithm for capacities of classical and classical-quantum channels.IEEE TRANSACTIONS ON INFORMATION THEORY,PP(99),1-1.

Hayashi，Masahito."Analytical algorithm for capacities of classical and classical-quantum channels".IEEE TRANSACTIONS ON INFORMATION THEORY PP.99(2022):1-1.