An Extended Coding Theorem with Application to Quantum Complexities
Samuel Epstein
TL;DR
This paper presents an extended coding theorem in algorithmic information theory, providing new bounds on quantum complexity measures and advancing understanding of quantum information processing.
Contribution
The paper introduces a novel inequality extending the coding theorem with applications to quantum complexity bounds.
Findings
New inequality in algorithmic information theory
Bounds between quantum complexity measures derived
Enhanced understanding of quantum information complexity
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Quantum Computing Algorithms and Architecture · Benford’s Law and Fraud Detection