Computing Quantum Channel Capacities
arXiv:1905.01286 · doi:10.1109/TIT.2020.3034471
Abstract
The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance. Capacities of classical channels are computed using alternating optimization schemes, called Blahut-Arimoto algorithms. In this work, we generalize classical Blahut-Arimoto algorithms to the quantum setting. In particular, we give efficient iterative schemes to compute the capacity of channels with classical input and quantum output, the quantum capacity of less noisy channels, the thermodynamic capacity of quantum channels, as well as the entanglement-assisted capacity of quantum channels. We give rigorous a priori and a posteriori bounds on the estimation error by employing quantum entropy inequalities and demonstrate fast convergence of our algorithms in numerical experiments.
arXiv commentv4: 22 pages, 4 figures, new title
References in corpus (18)
- The capacity of the noisy quantum channel
- Opening the Black Box of Deep Neural Networks via Information
- From Classical to Quantum Shannon Theory
- Monotone Riemannian Metrics and Relative Entropy on Non-Commutative Probability Spaces
- The Capacity of the Quantum Multiple Access Channel
- Semidefinite approximations of the matrix logarithm
- Multiplicativity of completely bounded p-norms implies a new additivity result
- Approximate reversibility in the context of entropy gain, information gain, and complete positivity
- Efficient optimization of the quantum relative entropy
- Quantum rate distortion, reverse Shannon theorems, and source-channel separation
- Thermodynamic Capacity of Quantum Processes
- Capacities of Quantum Channels and How to Find Them
- Private and Quantum Capacities of More Capable and Less Noisy Quantum Channels
- Efficient Approximation of Quantum Channel Capacities
- Channel Simulation and Coded Source Compression
- Convexity and Operational Interpretation of the Quantum Information Bottleneck Function
- On convex optimization problems in quantum information theory
- Non-thermal quantum channels as a thermodynamical resource
Cited by in corpus (13)
- Generic nonadditivity of quantum capacity in simple channels
- Bregman divergence based em algorithm and its application to classical and quantum rate distortion theory
- Efficient algorithms for quantum information bottleneck
- The platypus of the quantum channel zoo
- Thermodynamic Implementations of Quantum Processes
- Channel Simulation: Finite Blocklengths and Broadcast Channels
- Directed Data-Processing Inequalities for Systems with Feedback
- Efficient Computation of the Quantum Rate-Distortion Function
- Iterative minimization algorithm on a mixture family
- Generalized quantum Arimoto-Blahut algorithm and its application to quantum information bottleneck
- Five Starter Pieces: Quantum Information Science via Semi-definite Programs
- Analytical calculation formulas for capacities of classical and classical-quantum channels
- Reverse-type Data Processing Inequality