Efficient Approximation of Quantum Channel Capacities

DOI10.1109/TIT.2015.2503755MaRDI QIDQ2977087zbMATH OpenOpenAlexFDO

Authors David Sutter, Tobias Sutter, Peyman Mohajerin Esfahani, R. Renner

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.8202

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: We propose an iterative method for approximating the capacity of classical-quantum channels with a discrete input alphabet and a finite dimensional output, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. To provide an $varepsilon$-close estimate to the capacity, the presented algorithm requires $O(frac(NveeM)M^{3}log(N{)}^{1/2}varepsilon)$, where $N$ denotes the input alphabet size and $M$ the output dimension. We then generalize the method for the task of approximating the capacity of classical-quantum channels with a bounded continuous input alphabet and a finite dimensional output. For channels with a finite dimensional quantum mechanical input and output, the idea of a universal encoder allows us to approximate the Holevo capacity using the same method. In particular, we show that the problem of approximating the Holevo capacity can be reduced to a multidimensional integration problem. For families of quantum channels fulfilling a certain assumption we show that the complexity to derive an $varepsilon$-close solution to the Holevo capacity is subexponential or even polynomial in the problem size. We provide several examples to illustrate the performance of the approximation scheme in practice.

Cited in

(13)

• Geometric Rényi divergence and its applications in quantum channel capacities
• Lower and upper bounds on nonunital qubit channel capacities
• Second-order asymptotics for the classical capacity of image-additive quantum channels
• Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
• Efficient Approximation of Channel Capacities
• Methods for Estimating Capacities and Rates of Gaussian Quantum Channels
• Quantum Channel Capacities per Unit Cost
• Efficient optimization of the quantum relative entropy
• Generalized maximum entropy estimation
• Classical capacity of generalized Pauli channels
• Optimal Self-Concordant Barriers for Quantum Relative Entropies
• Reverse EM-problem based on Bregman divergence and its application to classical and quantum information theory
• Iterative minimization algorithm on a mixture family

This page was built for publication: Efficient Approximation of Quantum Channel Capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977087)