Analytical algorithm for capacities of classical and classical-quantum channels
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.
|ESI Research Field|
Cited Times [WOS]:0
|Document Type||Journal Article|
|Department||Institute for Quantum Science and Engineering|
Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology, Nanshan District, Shenzhen, China
|First Author Affilication||Institute for Quantum Science and Engineering|
|First Author's First Affilication||Institute for Quantum Science and Engineering|
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.
|Files in This Item:||There are no files associated with this item.|
|Recommend this item|
|Export to Endnote|
|Export to Excel|
|Export to Csv|
|Similar articles in Google Scholar|
|Similar articles in Baidu Scholar|
|Similar articles in Bing Scholar|
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.