Elements of information theory
Elements of information theory
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
SIAM Journal on Computing
SIAM Journal on Computing
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Universal compression of ergodic quantum sources
Quantum Information & Computation
Quantum Kolmogorov complexity based on classical descriptions
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A theorem of Brudno says that the entropy production of classical ergodic information sources equals the algorithmic complexity per symbol of almost every sequence emitted by such sources. The recent advances in the theory and technology of quantum information raise the question whether a same relation may hold for ergodic quantum sources. In this paper, we discuss a quantum generalization of Brudno's result which connects the von Neumann entropy rate and a recently proposed quantum algorithmic complexity.