The data compression theorem for ergodic quantum information sources

DOI10.1007/S11128-003-3195-1MaRDI QIDQ2573102zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Data compressionergodic sourcesquantum information

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Quantum computation (81P68) Source coding (94A29)

Abstract: We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically optimal compression scheme which is based on the concept of high probability subspaces. The rate of this compression scheme is equal to the von Neumann entropy rate.

Recommendations

• Universal compression of ergodic quantum sources
• Information compression and Varshamov-Gilbert bound
• Lossless quantum data compression and quantum Kolmogorov complexity
• Quantum entropy-typical subspace and universal data compression
• Compression of quantum information
• A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
• Estimates for compression norms and additivity violation in quantum information
• On the Distributed Compression of Quantum Information
• Non-Asymptotic Classical Data Compression With Quantum Side Information

Cites work

• A continuity property of the entropy density for spin lattice systems
• A New Proof of the Quantum Noiseless Coding Theorem
• Operations and measurements. II
• Pure operations and measurements
• Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
• Stationary quantum source coding
• The proper formula for relative entropy and its asymptotics in quantum probability
• The Shannon-McMillan theorem for ergodic quantum lattice systems

Cited in

(10)

• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• A quantum version of Sanov's theorem
• Stationary quantum source coding
• Entropy distance: new quantum phenomena
• Universal compression of ergodic quantum sources
• A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
• Statistical mechanics of the data compression theorem
• Quantum entropy-typical subspace and universal data compression
• Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein's lemma
• Partitioned trace distances

This page was built for publication: The data compression theorem for ergodic quantum information sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573102)