Converse coding theorems for quantums source and noisy channel
classification
🪐 quant-ph
keywords
channelsourcebeenboundcapacitycodingconverseproved
read the original abstract
The weak converse coding theorems have been proved for the quantum source and channel. The results give the lower bound for capacity of source and the upper bound for capacity of channel. The monotonicity of mutual quantum information have also been proved. PACS numbers: 03.65.Bz
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.