Technical Program

Paper Detail

Paper Title A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity
Paper IdentifierMO2.R5.2
Authors Haobo Li, Ning Cai, ShanghaiTech University, China
Session Quantum Channel Capacity and Codes
Location Saint Victor, Level 3
Session Time Monday, 08 July, 11:40 - 13:00
Presentation Time Monday, 08 July, 12:00 - 12:20
Manuscript  Click here to download the manuscript
Abstract Based on Arimoto's work in 1978, we propose an iterative algorithm for computing the capacity of a discrete memoryless classical-quantum channel with a finite input alphabet and a finite dimensional output, which we call the Blahut-Arimoto algorithm for classical-quantum channel, and an input cost constraint is considered. We show that the complexity of the algorithm is better than the already known algorithms. In particular, when the output state is linearly independent in complex matrix space, the algorithm has a geometric convergence.