Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem

DOI10.1007/s00220-006-0027-zzbMath1123.81010arXivquant-ph/0506080OpenAlexW1979697838MaRDI QIDQ2458453

Markus P. Müller, Rainer Siegmund-Schultze, Tyll Krueger, Arleta Szkoła, Fabio Benatti

Publication date: 1 November 2007

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0506080

Mathematics Subject Classification ID

Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of selfadjoint operator algebras to physics (46L60) Measures of information, entropy (94A17) Information theory (general) (94A15) Operator algebra methods applied to problems in quantum theory (81R15)

Related Items

Quantum information distance, Entropy and algorithmic complexity in quantum information theory, Fiber entropy and algorithmic complexity of random orbits, Quantum dynamical entropies and Gács algorithmic entropy, THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY, Quantum Kolmogorov complexity and information-disturbance theorem, Quantum Algorithmic Complexities and Entropy, Prefix-free quantum Kolmogorov complexity, ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS, Quantum algorithmic randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The proper formula for relative entropy and its asymptotics in quantum probability
• The Shannon-McMillan theorem for ergodic quantum lattice systems
• Physical complexity of classical and quantum objects and their dynamical evolution from an information-theoretic viewpoint
• Comparison of dynamical entropies for the noncommutative shifts
• Quantum redundancies and local realism
• The data compression theorem for ergodic quantum information sources
• Local Transition Functions of Quantum Turing Machines
• Statistical Structure of Quantum Theory
• Quantum algorithmic entropy
• Stationary quantum source coding
• A unified approach to weak universal source coding
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Algorithmic complexity of points in dynamical systems
• Quantum Computability
• Quantum Complexity Theory
• A New Proof of the Quantum Noiseless Coding Theorem
• Quantum Kolmogorov complexity based on classical descriptions
• Complexity distortion theory
• ALGORITHMIC COMPLEXITY OF QUANTUM STATES
• On the Length of Programs for Computing Finite Binary Sequences
• Logical basis for information theory and probability theory
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Coding of sources with unknown statistics--I: Probability of encoding error
• A formal theory of inductive inference. Part I
• Quantum Kolmogorov complexity