Algorithmic No-Cloning Theorem

We introduce notions of algorithmic mutual information and deficiency of randomness of quantum states. These definitions enjoy conservation inequalities over unitary transformations and partial traces. We show that a large majority of pure states have minute self-algorithmic information. We provide an algorithmic variant to the no-cloning theorem, by showing that only a small minority of quantum pure states can clone a nonnegligible amount of algorithmic information. We also provide a chain rule inequality for quantum algorithmic entropy. We show that deficiency of randomness does not increase under POVM measurements.

[1]  Buzek,et al.  Quantum copying: Beyond the no-cloning theorem. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[2]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[3]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[4]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[5]  A. Nies,et al.  Martin-Löf random quantum states , 2017, Journal of Mathematical Physics.

[6]  Paul M. B. Vitányi,et al.  Three approaches to the quantitative definition of information in an individual pure quantum state , 1999, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[7]  Leonid A. Levin,et al.  Randomness Conservation Inequalities; Information and Independence in Mathematical Theories , 1984, Inf. Control..

[8]  Péter Gács,et al.  Quantum algorithmic entropy , 2000, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[9]  Fabio Benatti,et al.  Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces , 2014 .

[10]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[11]  Markus Müller,et al.  Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno’s Theorem , 2005, ArXiv.

[12]  Sophie Laplante,et al.  Quantum Kolmogorov complexity , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[13]  A. Nies,et al.  Quantum Martin-Löf randomness , 2017 .

[14]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[15]  L. Levin,et al.  THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .