Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces
From MaRDI portal
Publication:3189933
DOI10.1063/1.4892516zbMath1301.82032OpenAlexW2045631263MaRDI QIDQ3189933
Samad Khabbazi Oskouei, Ahmad Shafiei Deh Abad, Fabio Benatti
Publication date: 12 September 2014
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.4892516
Quantum computation (81P68) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Measures of information, entropy (94A17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Algorithmic complexity of quantum capacity, Prefix-free quantum Kolmogorov complexity, Martin-Löf random quantum states
Cites Work
- Quantum dynamical entropies and Gács algorithmic entropy
- Mathematical foundations of quantum information and computation and its applications to nano- and bio-systems
- Dynamical entropy of C *-algebras and von Neumann algebras
- Une nouvelle définition de l'entropie dynamique des systèmes non commutatifs. (A new definition of dynamical entropy of non-commutative systems)
- Defining quantum dynamical entropy
- Dynamical approximation entropies and topological entropy in operator algebras
- Dynamics, information and complexity in quantum systems
- Quantum algorithmic entropy
- Algorithmic Randomness and Complexity
- Quantum chaos: An entropy approach
- Quantum Kolmogorov complexity based on classical descriptions
- On the Length of Programs for Computing Finite Binary Sequences
- A formal theory of inductive inference. Part I
- An introduction to Kolmogorov complexity and its applications
- Symmetry breaking.
- Quantum Kolmogorov complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
