Â鶹´«Ã½AV

Quantum Blahut-Arimoto Algorithms
Navneeth Ramakrishnan Raban Iten Volkher Scholz Mario Berta
Proceedings of the 2020 Â鶹´«Ã½AV International Symposium on Information Theory, Los Angeles, CA, USA, June 2020
Abstract

We generalize alternating optimization algorithms of Blahut-Arimoto type to the quantum setting. In particular, we give iterative algorithms to compute the mutual information of quantum channels, the thermodynamic capacity of quantum channels, the coherent information of less noisy quantum channels, and the Holevo quantity of classical-quantum channels. Our convergence analysis is based on quantum entropy inequalities and leads to a priori additive eps-approximations after O(eps^(-1)*log N) iterations, where N denotes the input dimension of the channel. We complement our analysis with an a posteriori stopping criterion which allows us to terminate the algorithm after significantly fewer iterations compared to the a priori criterion in numerical examples. Finally, we discuss heuristics to accelerate the convergence.