The Data Compression Theorem for Ergodic Quantum Information Sources
arXiv:quant-ph/0301043
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.
14 pages