Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
From MaRDI portal
Publication:3604703
DOI10.1109/TIT.2007.913263zbMath1314.68135arXivquant-ph/0605030MaRDI QIDQ3604703
No author found.
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0605030
Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (5)
Quantum dynamical entropies and Gács algorithmic entropy ⋮ An extended coding theorem with application to quantum complexities ⋮ Quantum Kolmogorov complexity and information-disturbance theorem ⋮ ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS ⋮ Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition
This page was built for publication: Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
