Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces
From MaRDI portal
Recommendations
Cites work
- A formal theory of inductive inference. Part I
- Algorithmic randomness and complexity.
- An introduction to Kolmogorov complexity and its applications
- Computability and randomness
- Defining quantum dynamical entropy
- Dynamical approximation entropies and topological entropy in operator algebras
- Dynamical entropy of C *-algebras and von Neumann algebras
- Dynamics, information and complexity in quantum systems
- scientific article; zbMATH DE number 3844071 (Why is no real title available?)
- scientific article; zbMATH DE number 1911266 (Why is no real title available?)
- Mathematical foundations of quantum information and computation and its applications to nano- and bio-systems
- On the Length of Programs for Computing Finite Binary Sequences
- Quantum algorithmic entropy
- Quantum chaos: An entropy approach
- Quantum dynamical entropies and Gács algorithmic entropy
- Quantum Kolmogorov complexity
- Quantum Kolmogorov complexity based on classical descriptions
- Symmetry breaking.
- Une nouvelle définition de l'entropie dynamique des systèmes non commutatifs. (A new definition of dynamical entropy of non-commutative systems)
Cited in
(7)
This page was built for publication: Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189933)