Quantum Kolmogorov complexity based on classical descriptions
From MaRDI portal
Publication:4544682
DOI10.1109/18.945258zbMath1021.94006arXivquant-ph/0102108MaRDI QIDQ4544682
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0102108
81P68: Quantum computation
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
94A15: Information theory (general)
Related Items
Quantum Kolmogorov complexity, Quantum Kolmogorov complexity and information-disturbance theorem, Entropy and algorithmic complexity in quantum information theory, Informational branching universe, Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem, LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY, THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY, SECOND QUANTIZED KOLMOGOROV COMPLEXITY, ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS