REVIEW
Capacity Bounds via Operator Space Methods
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Capacity Bounds via Operator Space Methods
read the original abstract
Quantum capacity, as the ultimate transmission rate of quantum communication, is characterized by regularized coherent information. In this work, we reformulate approximations of the quantum capacity by operator space norms and give both upper and lower bounds on quantum capacity, and potential quantum capacity using interpolation techniques. We identify a situation in which nice classes of channels satisfy a "comparison property" on entropy, coherent information and capacities. The paradigms for our estimates are so-called conditional expectations. These generally non-degradable channels admit a strongly additive expression for $Q^{(1)}$. We also identify conditions on channels showing that the "hashing bound" is optimal for the cb-entropy. These two estimates combined give upper and lower bounds on quantum capacity on our "nice" classes of channels, which differ only up to a factor 2, independent of the dimension. The estimates are discussed for certain classes of channels, including group channels, Pauli channels and other high-dimensional channels.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.