# 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

## TL;DR

This paper demonstrates a faster convergence of a Blahut-Arimoto type algorithm for classical-quantum channel capacity and introduces an explicit approximate solution for a specific binary-input, two-dimensional-output channel.

## Contribution

It provides empirical evidence of accelerated convergence and proposes a new approximate solution for a particular class of classical-quantum channels.

## Key findings

- Algorithm converges faster than predicted
- Explicit approximate solution with minimal error
- Applicable to binary-input, two-dimensional-output channels

## 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}$