Computing the Classical-Quantum channel capacity: experiments on a Blahut-Arimoto type algorithm and an approximate solution for the binary inputs, two-dimensional outputs channel

Haobo Li; Ning Cai

Computing the Classical-Quantum channel capacity: experiments on a Blahut-Arimoto type algorithm and an approximate solution for the binary inputs, two-dimensional outputs channel

Quantum Physics 2019-05-22 v1

Authors: Haobo Li , Ning Cai

Abstract

In our previous work, we presented a Blahut-Arimoto type algorithm for computing the discrete memoryless (DM) classical-quantum channel capacity. And the speed of convergence is analyzed. In this paper, we present numerical experiment to show that the algorithm converged much faster than the theoretical prediction. Also we present an explicit approximate solution for the binary inputs, two dimensional outputs classical-quantum channel, which has an error within $3\times10^{-4}$

Keywords

quantum channel capacity quantum algorithms quantum search algorithms

Cite

@article{arxiv.1905.08235,
  title  = {Computing the Classical-Quantum channel capacity: experiments on a Blahut-Arimoto type algorithm and an approximate solution for the binary inputs, two-dimensional outputs channel},
  author = {Haobo Li and Ning Cai},
  journal= {arXiv preprint arXiv:1905.08235},
  year   = {2019}
}

Comments

arXiv admin note: text overlap with arXiv:1904.11188

Computing the Classical-Quantum channel capacity: experiments on a Blahut-Arimoto type algorithm and an approximate solution for the binary inputs, two-dimensional outputs channel

Abstract

Keywords

Cite

Comments

Related papers