Quantum Algorithmic Complexities and Entropy
From MaRDI portal
Publication:3567165
DOI10.1142/S1230161209000025zbMath1188.81039MaRDI QIDQ3567165
Publication date: 11 June 2010
Published in: Open Systems & Information Dynamics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1230161209000025
81P68: Quantum computation
Related Items
Cites Work
- The proper formula for relative entropy and its asymptotics in quantum probability
- Entropy densities for algebraic states
- The Shannon-McMillan theorem for ergodic quantum lattice systems
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Quantum Dynamical Systems
- Can an individual sequence of zeros and ones be random?
- A Theory of Program Size Formally Identical to Information Theory
- Quantum Computability
- Quantum Complexity Theory
- Mixed-state entanglement and quantum error correction
- A Short Introduction to Quantum Information and Quantum Computation
- 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
- A formal theory of inductive inference. Part I
- A formal theory of inductive inference. Part II
- Quantum Kolmogorov complexity