Entropy and algorithmic complexity in quantum information theory
type: Item
instance of: scholarly article
title: Entropy and algorithmic complexity in quantum information theory
zbMATH Open document ID: 1120.68060
published in: Natural Computing
publication date: 2007-06-14T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 5164684
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: classical and quantum information
author: F. Benatti
MaRDI profile type: Publication
full work available at URL: s11047-006-9017-5
OpenAlex ID: W2012661176
cites work: Quantum Computability
cites work: Quantum dynamical systems
cites work: Comparison of dynamical entropies for the noncommutative shifts
cites work: Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
cites work: Quantum Complexity Theory
cites work: Quantum Kolmogorov complexity
cites work: Q5515914
cites work: The Shannon-McMillan theorem for ergodic quantum lattice systems
cites work: Q3314114
cites work: Q4806962
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: Q4023085
cites work: In What Sense is the Kolmogorov-Sinai Entropy a Measure for Chaotic Behaviour?—Bridging the Gap Between Dynamical Systems Theory and Communication Theory
cites work: Quantum algorithmic entropy
cites work: Q3522448
cites work: Q3214803
cites work: Logical basis for information theory and probability theory
cites work: Q4337021
cites work: Q2706552
cites work: A formal theory of inductive inference. Part I
cites work: Can an individual sequence of zeros and ones be random?
cites work: Quantum Kolmogorov complexity based on classical descriptions
DOI: 10.1007/S11047-006-9017-5
description: scientific article; zbMATH DE number 5164684