The data compression theorem for ergodic quantum information sources
From MaRDI portal
Publication:2573102
DOI10.1007/s11128-003-3195-1zbMath1130.81019arXivquant-ph/0301043OpenAlexW2063788938MaRDI QIDQ2573102
Igor Bjelaković, Arleta Szkoła
Publication date: 7 November 2005
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0301043
Quantum computation (81P68) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)
Related Items
Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein’s lemma ⋮ Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem ⋮ Partitioned trace distances ⋮ A quantum version of Sanov's theorem ⋮ Entropy distance: New quantum phenomena
Cites Work
- The proper formula for relative entropy and its asymptotics in quantum probability
- Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
- The Shannon-McMillan theorem for ergodic quantum lattice systems
- A continuity property of the entropy density for spin lattice systems
- Pure operations and measurements
- Operations and measurements. II
- Stationary quantum source coding
- A New Proof of the Quantum Noiseless Coding Theorem
This page was built for publication: The data compression theorem for ergodic quantum information sources