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• 35 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•108 citations

Prefix-free quantum Kolmogorov complexity

Tejas Bhojraj

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

Kolmogorov complexity in quantum mechanics and quantum computing

Alexei Kaltchenko

•Oct 10, 2021•0 citations

Quantum Observer and Kolmogorov Complexity

Alexei Grinbaum

•Apr 29, 2013•2 citations

Quantum Observer, Information Theory and Kolmogorov Complexity

Alexei Grinbaum

Springer eBooks•Jan 1, 2013•2 citations

Quantum Entropy and Complexity

Fabio Benatti, Samad Khabbazi Oskouei, A. Shafiei Deh Abad

We study the relations between the recently proposed machine-independent quantum complexity of P. Gacs [1] and the entropy of classical and quantum systems. On one hand, by restricting Gacs complexity to ergodic classical dynamical systems, we retrieve the equality between the Kolmogorov complexity rate and the Shannon entropy rate derived by A. A. Brudno [2]. On the other hand, using the quantum Shannon-McMillan theorem [3], we show that such an equality holds densely in the case of ergodic quantum spin chains.

arXiv:1705.09449•Open Systems & Information Dynamics•Jun 1, 2017•1 citation
We study the relations between the recently proposed machine-independent quantum complexity of P. Gacs [1] and the entropy of classical and quantum systems. On one hand, by restricting Gacs complexity to ergodic classical dynamical systems, we retrieve the equality between the Kolmogorov complexity rate and the Shannon entropy rate derived by A. A. Brudno [2]. On the other hand, using the quantum Shannon-McMillan theorem [3], we show that such an equality holds densely in the case of ergodic quantum spin chains.