Universal quantum information compression and degrees of prior knowledge

DOI10.1098/RSPA.2003.1162MaRDI QIDQ3043415zbMATH OpenOpenAlexFDO

Authors Richard Jozsa, Stuart Presnell

Publication date 6 August 2004

Published in Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0210196

zbMATH Keywords

information compressionLempel-Ziv compressionquantum entropyquantum informationuniversal compression

Mathematics Subject Classification ID

Quantum computation (81P68) Information theory (general) (94A15)

Abstract: We describe a universal information compression scheme that compresses any pure quantum i.i.d. source asymptotically to its von Neumann entropy, with no prior knowledge of the structure of the source. We introduce a diagonalisation procedure that enables any classical compression algorithm to be utilised in a quantum context. Our scheme is then based on the corresponding quantum translation of the classical Lempel-Ziv algorithm. Our methods lead to a conceptually simple way of estimating the entropy of a source in terms of the measurement of an associated length parameter while maintaining high fidelity for long blocks. As a by-product we also estimate the eigenbasis of the source. Since our scheme is based on the Lempel-Ziv method, it can be applied also to target sequences that are not i.i.d.

Recommendations

• Simple construction of quantum universal variable-length source coding
• Compression of quantum information
• Universal compression of ergodic quantum sources
• Quantum entropy-typical subspace and universal data compression
• On Lossless Quantum Data Compression With a Classical Helper

Cited in

(11)

• Quantum compression relative to a set of measurements
• Efficient and exact quantum compression
• Lossless quantum data compression and quantum Kolmogorov complexity
• Quantum and Fisher information from the Husimi and related distributions
• Simple construction of quantum universal variable-length source coding
• Universal compression of ergodic quantum sources
• Reversible arithmetic coding for quantum data compression
• Asymptotic redundancies for universal quantum coding
• Quantum entropy-typical subspace and universal data compression
• Universal coding for transmission of private information
• Universal approximation of multi-copy states and universal quantum lossless data compression

This page was built for publication: Universal quantum information compression and degrees of prior knowledge

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