Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus, a vast amount of literature is devoted to finding tight and computable bounds on these capacities. We add a new viewpoint by giving operationally motivated bounds on several capacities, including the quantum capacity and private capacity of a quantum channel and the one-way distillable entanglement and private key of a quantum state. These bounds are generally phrased in terms of capacity quantities involving the complementary channel or state. As a tool to obtain these bounds, we discuss partial orders on quantum channels and states, such as the less noisy and the more capable order. Our bounds help to further understand the interplay between different capacities, as they give operational limitations on superadditivity and the difference between capacities in terms of the information-theoretic properties of the complementary channel or state. They can also be used as a new approach towards numerically bounding capacities, as discussed with some examples.
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 Holevo quantity of classical-quantum channels, the coherent information of less noisy quantum channels, and the thermodynamic capacity of quantum channels. Our convergence analysis is based on quantum entropy inequalities and leads to a priori additive
ε-approximations after
O(ε−1logN) 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.
The fidelity and the entanglement fidelity are two important quantities in describing the transmission of quantum information through (possibly noisy) quantum channels. In this paper these two quantities are calculated for different kinds of state which are transmitted in noisy channels. A general equation is obtained for these fidelities. Some examples are given to illustrate the general result and possible applications of these results to quantum cryptography and teleportation via noisy channels are discussed.