Ming Li Paul Vitányi Fourth Edition Page 1 An Introduction to Kolmogorov Complexity and Its
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …

The first edition of the monograph Information and Randomness: An Algorithmic Perspective
by Crist ian Calude was published in 1994. In my Foreword I said:" The research in …

Given a computable probability measure over natural numbers or infinite binary sequences,
there is no computable, randomized method that can produce an arbitrarily large sample …

In this paper we give a definition for quantum Kolmogorov complexity. In the classical
setting, the Kolmogorov complexity of a string is the length of the shortest program that can …

The problem of characterizing the complexity of quantum dynamics—in particular of locally
interacting chains of quantum particles—will be reviewed and discussed from several …

Extends algorithmic information theory to quantum mechanics, taking a universal semi-
computable density matrix (" universal probability") as a starting point, and defines …

We develop a theory of the algorithmic information in bits contained in an individual pure
quantum state. This extends classical Kolmogorov complexity to the quantum domain …

In the standard circuit model of quantum computation, the number and quality of the
quantum gates composing the circuit influence the runtime and fidelity of the computation …

Algorithms with unitary oracles can be nested, which makes them extremely versatile. An
example is the phase estimation algorithm used in many candidate algorithms for quantum …

Focus of the first edition of this book was quantum dynamics in connection with correlations
as carriers of information and entropy as a measure of information. In the same spirit, this …