Asymptotic redundancies for universal quantum coding

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Quantum computation (81P68) Measures of information, entropy (94A17) Information theory (general) (94A15) Source coding (94A29)

Related Items (9)

Efficient quantum information processing via quantum compressions ⋮ Quasirandom estimations of two-qubit operator-monotone-based separability probabilities ⋮ Universal coding for classical-quantum channel ⋮ Bures metrics for certain high-dimensional quantum systems ⋮ Comparative noninformativities of quantum priors based on monotone metrics ⋮ Silver mean conjectures for 15-dimensional volumes and 14-dimensional hyperareas of the separable two-qubit systems ⋮ Universal approximation of multi-copy states and universal quantum lossless data compression ⋮ Qubit-qutrit separability-probability ratios ⋮ Quantum and Fisher information from the Husimi and related distributions

This page was built for publication: Asymptotic redundancies for universal quantum coding