On Gács' quantum algorithmic entropy

Abstract

We define an infinite dimensional modification of lower-semicomputability of density operators by Gács with an attempt to fix some problem in the paper. Our attempt is partly achieved by showing the existence of universal operator under some additional assumption. It is left as a future task to eliminate this assumption. We also see some properties and examples which stimulate further research. In particular, we show that universal operator has certain nontrivial form if it exists.

In Proceedings QPL 2014, arXiv:1412.8102

References in corpus (7)

• Quantum Kolmogorov Complexity Based on Classical Descriptions
• Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem
• Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
• Quantum Kolmogorov Complexity and the Quantum Turing Machine
• An extension of Chaitin's halting probability Ωto a measurement operator in an infinite dimensional quantum system
• Quantum Bit Strings and Prefix-Free Hilbert Spaces
• Quantum Kolmogorov Complexity and Information-Disturbance Theorem