Lossless quantum data compression and quantum Kolmogorov complexity

DOI10.1142/S0219749911007848MaRDI QIDQ3015424zbMATH OpenFDO

Authors Caroline Rogers, Rajagopal Nagarajan

Publication date 13 July 2011

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219749911007848

zbMATH Keywords

base lengthindeterminate lengthlossless quantum data compressionquantum Kolmogorov complexity

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Recommendations

• On Lossless Quantum Data Compression With a Classical Helper
• Quantum Kolmogorov complexity based on classical descriptions
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Universal quantum information compression and degrees of prior knowledge
• Quantum Kolmogorov complexity

Cites work

• A quantum analog of Huffman coding
• ALGORITHMIC COMPLEXITY OF QUANTUM STATES
• Algorithmic Information Theory
• Chaitin numbers and halting problems
• scientific article; zbMATH DE number 2132451 (Why is no real title available?)
• Inequalities for Shannon entropy and Kolmogorov complexity
• Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
• On Feedback and the Classical Capacity of a Noisy Quantum Channel
• On Lossless Quantum Data Compression With a Classical Helper
• Quantum algorithmic entropy
• Quantum Kolmogorov complexity
• QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
• Quantum Kolmogorov complexity based on classical descriptions
• Quantum rate-distortion theory for memoryless sources
• SECOND QUANTIZED KOLMOGOROV COMPLEXITY
• The quantum adversary method and classical formula size power bounds
• THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY

Cited in

(8)

• The data compression theorem for ergodic quantum information sources
• Compression of quantum information
• Near-optimal extractors against quantum storage
• On Lossless Quantum Data Compression With a Classical Helper
• Quantum information distance
• Probing the quantum-classical boundary with compression software
• Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
• Universal approximation of multi-copy states and universal quantum lossless data compression

This page was built for publication: Lossless quantum data compression and quantum Kolmogorov complexity

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