Coding theorems for hybrid channels. II
A. A. Kuznetsova, A. S. Holevo

TL;DR
This paper extends the theoretical understanding of measurement channels' capacities in quantum information, providing coding theorems for classical and entanglement-assisted capacities without restrictive assumptions.
Contribution
It offers new coding theorems for measurement channels with arbitrary outputs, broadening the scope of quantum channel capacity analysis.
Findings
Proved coding theorems for classical capacity of measurement channels.
Established entanglement-assisted classical capacity results.
Generalized capacity results to channels with arbitrary output alphabets.
Abstract
The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}. The proof of coding theorems is given for the classical capacity and entanglement-assisted classical capacity of the measurement channel with arbitrary output alphabet, without assuming that the channel is given by a bounded operator-valued density.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
