LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY
From MaRDI portal
Publication:3015424
DOI10.1142/S0219749911007848zbMath1219.81065MaRDI QIDQ3015424
Rajagopal Nagarajan, Caroline Rogers
Publication date: 13 July 2011
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum coding (general) (81P70)
Related Items (1)
Cites Work
- Unnamed Item
- Inequalities for Shannon entropy and Kolmogorov complexity
- The quantum adversary method and classical formula size power bounds
- Quantum algorithmic entropy
- QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
- THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
- SECOND QUANTIZED KOLMOGOROV COMPLEXITY
- On Lossless Quantum Data Compression With a Classical Helper
- On Feedback and the Classical Capacity of a Noisy Quantum Channel
- Chaitin Ω Numbers and Halting Problems
- Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
- Algorithmic Information Theory
- A quantum analog of Huffman coding
- Quantum Kolmogorov complexity based on classical descriptions
- Quantum rate-distortion theory for memoryless sources
- ALGORITHMIC COMPLEXITY OF QUANTUM STATES
- Quantum Kolmogorov complexity
This page was built for publication: LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY