Asymptotic redundancies for universal quantum coding
DOI10.1109/18.841164zbMath0999.94019arXivmath/9705212MaRDI 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 entropy; monotone metric; quantum information theory; Jeffreys' prior; universal coding; symmetric logarithmic derivative; ballot paths; two-level quantum systems; quantum coding; Bayes codes; universal data compression; Bayesian density matrices; Kubo-Mori/Bogoliubov metric; quantum asymptotic redundancy formulas; redundancy formulas; Schumacher compression
81P68: Quantum computation
94A17: Measures of information, entropy
94A15: Information theory (general)
94A29: Source coding
Related Items