Algorithms of Arimoto-Blahut type for computing quantum channel capacity
Hiroshi Nagaoka · 2002
In the Arimoto-Blahut (1972) algorithm for computing the capacity of a classical discrete memoryless channel, maximization of the mutual information is converted to more tractable alternating maximization of a two-variable function. We apply the same idea to computation of the capacity of a quantum memoryless channel.