Entropy and algorithmic complexity in quantum information theory

DOI10.1007/s11047-006-9017-5zbMath1120.68060OpenAlexW2012661176MaRDI QIDQ885683

Fabio Benatti

Publication date: 14 June 2007

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-006-9017-5

zbMATH Keywords

algorithmic complexityclassical and quantum information

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

Fiber entropy and algorithmic complexity of random orbits, COMPLEXITY, INFORMATION, ENERGY, COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Shannon-McMillan theorem for ergodic quantum lattice systems
• Comparison of dynamical entropies for the noncommutative shifts
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Quantum algorithmic entropy
• Quantum Dynamical Systems
• Can an individual sequence of zeros and ones be random?
• Quantum Computability
• Quantum Complexity Theory
• Quantum Kolmogorov complexity based on classical descriptions
• In What Sense is the Kolmogorov-Sinai Entropy a Measure for Chaotic Behaviour?—Bridging the Gap Between Dynamical Systems Theory and Communication Theory
• On the Length of Programs for Computing Finite Binary Sequences
• Logical basis for information theory and probability theory
• A formal theory of inductive inference. Part I
• Quantum Kolmogorov complexity