Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0506080 · Communications in Mathematical Physics

Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno’s Theorem

Fabio Benatti, Tyll Krüger, Markus P. Müller, Rainer Siegmund‐Schultze, Arleta Szkoła

Published May 10, 2006• 37 citations
arXivHTMLPDF
DOI
10.1007/s00220-006-0027-z

Related papers

Quantum Kolmogorov Complexity

André Berthiaume, Wim van Dam, Sophie Laplante

arXiv:quant-ph/0005018•Journal of Computer and System Sciences•Sep 1, 2001•113 citations

Prefix-free quantum Kolmogorov complexity

Tejas Bhojraj

arXiv:2101.11686•Theoretical Computer Science•May 21, 2021•5 citations

Quantum Observer and Kolmogorov Complexity

Alexei Grinbaum

•Apr 29, 2013•2 citations

Kolmogorov complexity in quantum mechanics and quantum computing

Alexei Kaltchenko

•Oct 10, 2021•0 citations

Quantum Observer, Information Theory and Kolmogorov Complexity

Alexei Grinbaum

Springer eBooks•Jan 1, 2013•2 citations

Kolmogorov Complexity and Combinatorial Methods in Communication Complexity

Marc A. Kaplan, Sophie Laplante

Theoretical Computer Science•Jan 1, 2009•5 citations