Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Information Theory and Reliable Communication
Information Theory and Reliable Communication
On quantum fidelities and channel capacities
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Entropy and algorithmic complexity in quantum information theory
Natural Computing: an international journal
Hi-index | 0.00 |
For a real number r 0, let F(r) be the family of all stationary ergodic quantum sources with von Neumann entropy rates less than r. We prove that, for any r 0, there exists a blind, source-independent block compression scheme which compresses every source from F(r) to rn qubits per input block length n with arbitrarily high fidelity for all large n. As our second result, we show that the stationarity and the ergodicity of a quantum source {ρm}m=1∞ are preserved by any trace-preserving completely positive linear map of the tensor product form ε⊗m, where a copy of ε acts locally on each spin lattice site. We also establish ergodicity criteria for so called classically-correlated quantum sources.