Coding Theorem and Strong Converse for Quantum Channels
read the original abstract
In this correspondence we present a new proof of Holevo's coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz's combinatorial approach using types of sequences. As a by-product of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Resource-Theoretic Quantifiers of Weak and Strong Symmetry Breaking: Strong Entanglement Asymmetry and Beyond
A resource theory for strong symmetry breaking is formulated, with the variance of the conserved quantity characterizing its asymptotic manipulation for U(1) symmetry and enabling tracking of weak-to-strong conversion...
-
Approximating Unitary Preparations of Orthogonal Black Box States
For two orthogonal black-box n-qubit states, a poly(n, 1/ε)-size approximating unitary exists that maps basis states to them while resetting all auxiliaries on every input.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.