The Data Compression Theorem for Ergodic Quantum Information Sources
classification
🪐 quant-ph
keywords
compressiondataergodicinformationquantumrateschemesources
read the original abstract
We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically optimal compression scheme which is based on the concept of high probability subspaces. The rate of this compression scheme is equal to the von Neumann entropy rate.
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.