Asymptotic redundancies for universal quantum coding
Publication:4503581
DOI10.1109/18.841164zbMath0999.94019arXivmath/9705212OpenAlexW2168944909MaRDI QIDQ4503581
Paul B. Slater, Christian Krattenthaler
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9705212
relative entropymonotone metricquantum information theoryJeffreys' prioruniversal codingsymmetric logarithmic derivativeballot pathstwo-level quantum systemsquantum codingBayes codesuniversal data compressionBayesian density matricesKubo-Mori/Bogoliubov metricquantum asymptotic redundancy formulasredundancy formulasSchumacher compression
Quantum computation (81P68) Measures of information, entropy (94A17) Information theory (general) (94A15) Source coding (94A29)
Related Items