Indeterminate-length quantum coding
arXiv:quant-ph/0011014 · doi:10.1103/PhysRevA.64.042304
Abstract
The quantum analogues of classical variable-length codes are indeterminate-length quantum codes, in which codewords may exist in superpositions of different lengths. This paper explores some of their properties. The length observable for such codes is governed by a quantum version of the Kraft-McMillan inequality. Indeterminate-length quantum codes also provide an alternate approach to quantum data compression.
32 pages
Cited by in corpus (17)
- A Survey on Quantum Channel Capacities
- Properties of Classical and Quantum Jensen-Shannon Divergence
- Quantum data compression, quantum information generation, and the density-matrix renormalization group method
- Procedures for Converting among Lindblad, Kraus and Matrix Representations of Quantum Dynamical Semigroups
- Quantum learning and universal quantum matching machine
- Quantum universal variable-length source coding
- Quantum Algorithmic Entropy
- Tight bound on relative entropy by entropy difference
- Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
- Quantum Mixed State Compiling
- Quantum Kolmogorov Complexity and the Quantum Turing Machine
- Quantum Data Compression and Quantum Cross Entropy
- Lossless Quantum Prefix Compression for Communication Channels that are Always Open
- Energy Requirements for Quantum Data Compression and 1-1 Coding
- Optimality in Quantum Data Compression using Dynamical Entropy
- Quantum Data Compression and Relative Entropy Revisited
- Second Quantized Kolmogorov Complexity