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