An Extended Coding Theorem with Application to Quantum Complexities

Abstract

This paper introduces a new inequality in algorithmic information theory that can be seen as an extended coding theorem. This inequality has applications in new bounds between quantum complexity measures.

18 pages, 4 figures

References in corpus (2)

• Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
• Sets Have Simple Members