Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 2003 · 30 citations · 18 references
ComputingComputer SciencePhysicsInformation TheoryQuantum ComputingQuantum MechanicsData CompressionQuantum AlgorithmsQuantum ComputationQuantum Information TheorySource CodingUniversal CodingCompressionEntropy In Quantum InformationInformation CompressionLempel-ziv CompressionQuantum Data CompressionQuantum Source CodingUniversal Entropy EstimationVon Neumann Entropy
We describe a universal information–compression scheme that compresses any pure quantum independent identically distributed (i.i.d.) source asymptotically to its von Neumann entropy, with no prior knowledge of the structure of the source. We introduce a diagonalization procedure that enables any classical compression algorithm to be used 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 byproduct we also estimate the eigenbasis of the source. Since our scheme is based on the Lempel–Ziv method, it can potentially be applied also to non–i.i.d. sources that satisfy some further regularity conditions.
18
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
Logical Reversibility of Computation
C. H. Bennett · IBM Journal of Research and Development · 1973 · 3.7K citations
Fidelity for Mixed Quantum States
Richard Jozsa · Journal of Modern Optics · 1994 · 1.9K citations
The “transition probability” in the state space of a ∗-algebra
Armin Uhlmann · Reports on Mathematical Physics · 1976 · 1.7K citations