Quantum source coding and data compression
نویسنده
چکیده
This lecture is intended to be an easily accessible first introduction to quantum information theory. The field is large and it is not completely covered even by the recent monograph [15]. Therefore the simple topic of data compression is selected to present some ideas of the theory. Classical information theory is not a prerequisite, we start with the basics of Shannon theory to give a feeling for Shannon entropy and for the informational divergence or relative entropy. The aim is to present Schumacher’s compression theorem and to demonstrate that the von Neumann entropy, introduced in the 1920’s by thermodynamical considerations, is a measure of quantum information exactly in the way as the Shannon entropy is that for classical information. Our discussion makes clear that the compression theorem depends heavily on the existence of the high-probability subspace. At the end of the lecture quantum sources with memory and some related questions are briefly discussed. This part could be skipped by new-comers in the field.
منابع مشابه
Stationary quantum source coding
In this paper the quantum version of the source coding theorem is obtained for a completely ergodic source. This result extends Schumacher’s quantum noiseless coding theorem for memoryless sources. The control of the memory effects requires some earlier results of Hiai and Petz on high probability subspaces. Our result is equivalently considered as a compression theorem for noiseless stationary...
متن کاملQuantum Information Chapter 10. Quantum Shannon Theory
Contents 10 Quantum Shannon Theory 1 10.1 Shannon for Dummies 2 10.1.1 Shannon entropy and data compression 2 10.1.2 Joint typicality, conditional entropy, and mutual information 6 10.1.3 Distributed source coding 8 10.1.4 The noisy channel coding theorem 9 10.2 Von Neumann Entropy 16 10.2.1 Mathematical properties of H(ρ) 18 10.2.2 Mixing, measurement, and entropy 20 10.2.3 Strong subadditivit...
متن کاملOn Lossless Quantum Data Compression and Quan- tum Variable–Length Codes
In Shannon’s Foundation of Information Theory ([27]) perhaps the most basic contributions are Source Coding Theorems (lossy and lossless) and the Channel Coding Theorem. In the most natural and simple source model DMS the source outputs a sequence X1, X2, . . . of independent, identically distributed random variables taking finitely many values. The Lossy Source Coding Theorem says that this se...
متن کاملData Compression Limit for an Information Source of Interacting Qubits
A system of interacting qubits can be viewed as a non-i.i.d quantum information source. A possible model of such a source is provided by a quantum spin system, in which spin-1/2 particles located at sites of a lattice interact with each other. We establish the limit for the compression of information from such a source and show that asymptotically it is given by the von Neumann entropy rate. Ou...
متن کاملExponents of quantum fixed-length pure state source coding
We derive the optimal exponent of the error probability of the quantum fixedlength pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Josza et al. (PRL, 81, 1714 (1998))’s universal code. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))’s lemma is essential. In the direct part, a group representation theoretic...
متن کاملQuantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources
The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004