Quantum blahut-arimoto algorithms
File(s)
Submitted version
Author(s)
Ramakrishnan, Navneeth
Iten, Raban
Scholz, Volkher
Berta, Mario
Type
Conference Paper
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 ε-approximations after O (ε -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
Date Issued
2020-06
Date Acceptance
2020-05-01
Citation
2020 IEEE International Symposium on Information Theory (ISIT), 2020
Publisher
IEEE
Journal / Book Title
2020 IEEE International Symposium on Information Theory (ISIT)
Copyright Statement
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Identifier
https://ieeexplore.ieee.org/document/9174429
Source
2020 IEEE International Symposium on Information Theory (ISIT)
Publication Status
Published
Start Date
2020-06-21
Finish Date
2020-06-26
Coverage Spatial
Los Angeles, CA, USA