# Efficient Approximation of Quantum Channel Capacities

@article{Sutter2014EfficientAO,
title={Efficient Approximation of Quantum Channel Capacities},
author={David Sutter and Tobias Sutter and Peyman Mohajerin Esfahani and Renato Renner},
journal={IEEE Transactions on Information Theory},
year={2014},
volume={62},
pages={578-598}
}
• Published 30 July 2014
• Computer Science
• IEEE Transactions on Information Theory
We propose an iterative method for approximating the capacity of classical-quantum channels with a discrete input alphabet and a finite-dimensional output 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 additive ε-close estimate to the capacity, the presented algorithm requires O((N ν M)M3 log(N)1/2ε-1) steps, where N denotes the input alphabet size and M denotes the output…

## Figures from this paper

• Computer Science
IEEE Transactions on Information Theory
• 2015
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex
• Computer Science
Entropy
• 2020
It is shown that, to reach ε accuracy, the iteration complexity of the algorithm is upper bounded by lognlogεε where n is the size of the input alphabet and the algorithm has a geometric convergence when the output state {ρx}x∈X is linearly independent in complex matrix space.
• Computer Science
• 2018
The notion of a generalized channel divergence is defined (which includes the diamond distance as an example), and it is proved that for jointly covariant channels these quantities are maximized by purifications of a state invariant under the covariance group.
• Computer Science
IEEE Transactions on Information Theory
• 2021
This work gives rigorous a priori and a posteriori bounds on the estimation error by employing quantum entropy inequalities and demonstrates fast convergence of their algorithms in numerical experiments.
• Computer Science
2019 IEEE International Symposium on Information Theory (ISIT)
• 2019
The Blahut-Arimoto algorithm for classical-quantum channel is called, and an input cost constraint is considered, and it is shown that to reach ε accuracy, the iteration complexity of the algorithm is up bounded by n where n is the size of the input alphabet.
A framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes is developed and the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel is established.
• Computer Science
Communications in Mathematical Physics
• 2021
This work proves a chain rule inequality that immediately implies the “amortization collapse” for the geometric Rényi divergence, addressing an open question by Berta et al. in the area of quantum channel discrimination.
The bounds of the Holevo capacity and classical capacity for the generalized Pauli channels are analyzed and the lower and upper bounds are obtained and it is shown that, if these bounds coincide, the HoleVO capacity is weakly additive.
• Computer Science
• 2019
Numerical experiment is presented to show that the algorithm converged much faster than the theoretical prediction, and an explicit approximate solution for the binary inputs, two dimensional outputs classical-quantum channel, which has an error within 3-4.
• Computer Science
2020 IEEE International Symposium on Information Theory (ISIT)
• 2020
The convergence analysis is based on quantum entropy inequalities and leads to a priori additive ε-approximations after $\mathcal{O}\left( {{\varepsilon ^{ - 1}}\log N} \right)$ iterations, where N denotes the input dimension of the channel.

## References

SHOWING 1-10 OF 70 REFERENCES

• Computer Science
IEEE Transactions on Information Theory
• 2015
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex
• Computer Science
• 2009
We prove that a broad array of capacities of a quantum channel are continuous. That is, two channels that are close with respect to the diamond norm have correspondingly similar communication
• Computer Science
• 2008
It is proved that computing the Holevo capacity as well as the minimum entropy of a quantum channel is NP-complete, and it is shown that the clique problem is QMA-complete.
• Computer Science
2014 IEEE International Symposium on Information Theory
• 2014
We present a new algorithm, based on duality of convex programming and the specific structure of the channel capacity problem, to iteratively construct upper and lower bounds for the capacity of
• R. Blahut
• Computer Science
IEEE Trans. Inf. Theory
• 1972
A simple algorithm for computing channel capacity is suggested that consists of a mapping from the set of channel input probability vectors into itself such that the sequence of probability vectors generated by successive applications of the mapping converges to the vector that achieves the capacity of the given channel.
• Computer Science
IEEE Transactions on Information Theory
• 2013
This paper proves that the quantum rate-distortion function is given in terms of the regularized entanglement of purification, and establishes several quantum source-channel separation theorems in theEntanglement-assisted setting, in which a necessary and sufficient condition for transmitting a memoryless source over aMemoryless quantum channel up to a given distortion.
• I. Devetak
• Physics, Computer Science
IEEE Transactions on Information Theory
• 2005
Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical information and quantum information are exploited to obtain an expression for the capacity of a quantum channel for generating pure bipartite entanglement.
The results show that the most basic question of classical capacity of a quantum channel remains open, with further work needed to determine in which other situations entanglement can boost capacity.
• Physics
• 2000
The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns
• Physics
Quantum Inf. Comput.
• 2005
An example is given of a qubit quantum channel which requires four inputs to maximize the Holevo capacity and a conjecture about the concavity of output entropy as a function of entanglement parameters is supported.