An extended coding theorem with application to quantum complexities

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.

Authors

• Samuel Epstein

Keywords

No keywords are indexed for this paper.