An Extended Coding Theorem with Application to Quantum Complexities
Computational Complexity
2021-01-25 v3
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.
Cite
@article{arxiv.1511.05006,
title = {An Extended Coding Theorem with Application to Quantum Complexities},
author = {Samuel Epstein},
journal= {arXiv preprint arXiv:1511.05006},
year = {2021}
}
Comments
18 pages, 4 figures