Quantum algorithmic entropy
From MaRDI portal
Publication:2766202
DOI10.1088/0305-4470/34/35/312zbMath1027.81005arXivquant-ph/0011046OpenAlexW1999580286MaRDI QIDQ2766202
Publication date: 27 January 2002
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0011046
Kolmogorov complexitycloning propertiescomplexity an operator as its negative logarithmvon Neumann entropy of a computable density matrix
Quantum computation (81P68) Measures of information, entropy (94A17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Quantum information distance ⋮ Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) ⋮ Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces ⋮ Algorithmic complexity of quantum capacity ⋮ Entropy and algorithmic complexity in quantum information theory ⋮ THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY ⋮ An extended coding theorem with application to quantum complexities ⋮ SECOND QUANTIZED KOLMOGOROV COMPLEXITY ⋮ Quantum Kolmogorov complexity and information-disturbance theorem ⋮ Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem ⋮ LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY ⋮ Informational branching universe ⋮ Quantum Kolmogorov complexity ⋮ Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness ⋮ ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS
This page was built for publication: Quantum algorithmic entropy
