Quantum sources and a quantum coding theorem
From MaRDI portal
Abstract: We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical source provides an upper bound for the dimension of the relevant subspace of the quantum source, via the Shannon-McMillan noiseless coding theorem. Along the way we derive a bound for the von Neumann entropy of the quantum source in terms of the Shannon entropy of the classical source, and we provide a definition of ergodicity of the quantum source. Several explicit models of quantum sources are also presented.
Recommendations
- Quantum coding theorems
- scientific article; zbMATH DE number 1944611
- Coding theorems of classical and quantum information theory.
- scientific article; zbMATH DE number 5320294
- Quantum Coding Theorem from Privacy and Distinguishability
- scientific article; zbMATH DE number 5508888
- On a class of quantum codes.
- Coding theorem and strong converse for quantum channels
- A coding problem via quantum channels
- Quantum information theory
Cites work
Cited in
(17)- The Shannon-McMillan theorem for ergodic quantum lattice systems
- scientific article; zbMATH DE number 1643848 (Why is no real title available?)
- Stationary quantum source coding
- Simple construction of quantum universal variable-length source coding
- Universal compression of ergodic quantum sources
- scientific article; zbMATH DE number 5320294 (Why is no real title available?)
- scientific article; zbMATH DE number 5508888 (Why is no real title available?)
- A Resource Framework for Quantum Shannon Theory
- The Shannon-McMillan theorem for AF C^-systems
- scientific article; zbMATH DE number 1944611 (Why is no real title available?)
- On the reversible extraction of classical information from a quantum source
- Quantum birthday problems: geometrical aspects of quantum random coding
- Quantum rate-distortion theory for memoryless sources
- A fixed-length source coding theorem on quasi-probability space
- Theory of a pair of quantum bits.
- Source coding with quantum side information at several decoders
- Entropy and algorithmic complexity in quantum information theory
This page was built for publication: Quantum sources and a quantum coding theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4212620)