ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS

DOI10.1142/S0219749909005456zbMath1172.81006arXiv0707.2924MaRDI QIDQ3637941

Markus P. Müller

Publication date: 14 July 2009

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

Full work available at URL: https://arxiv.org/abs/0707.2924

zbMATH Keywords

quantum Kolmogorov complexityquantum operationquantum Turing machine

Mathematics Subject Classification ID

Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) String and superstring theories; other extended objects (e.g., branes) in quantum field theory (81T30)

Cites Work

• Unnamed Item
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Quantum algorithmic entropy
• Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
• Quantum Complexity Theory
• Quantum Kolmogorov complexity based on classical descriptions
• Logical Reversibility of Computation
• Quantum Kolmogorov complexity

This page was built for publication: ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS