An extended coding theorem with application to quantum complexities

DOI10.1016/j.ic.2020.104660zbMath1496.68159arXiv1511.05006OpenAlexW3098697362MaRDI QIDQ2216136

Samuel Epstein

Publication date: 15 December 2020

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.05006

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum algorithmic entropy
• Algorithmic Statistics: Forty Years Later
• Kolmogorov's Structure Functions and Model Selection
• Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
• A Theory of Program Size Formally Identical to Information Theory
• Discussion on Kolmogorov Complexity and Statistical Analysis
• Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity
• On Algorithmic Strong Sufficient Statistics
• A formal theory of inductive inference. Part I
• An introduction to Kolmogorov complexity and its applications
• Quantum Kolmogorov complexity

This page was built for publication: An extended coding theorem with application to quantum complexities