DeepAI AI Chat
Log In Sign Up

Algorithmic No-Cloning Theorem

by   Samuel Epstein, et al.
Apple, Inc.

We introduce the notions of algorithmic mutual information and rarity 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 non negligible amount of algorithmic information. We also provide a chain rule inequality for quantum algorithmic entropy. We show that rarity does not increase under POVM measurements.


page 1

page 2

page 3

page 4


On the Algorithmic Content of Quantum Measurements

We show that given a quantum measurement, for an overwhelming majority o...

A Quantum Outlier Theorem

In recent results, it has been proven that all sampling methods produce ...

On the Algorithmic Information Between Probabilities

We extend algorithmic conservation inequalities to probability measures....

Agents, subsystems, and the conservation of information

Dividing the world into subsystems is an important component of the scie...

Proofs of conservation inequalities for Levin's notion of mutual information of 1974

In this paper we consider Levin's notion of mutual information in infini...

Gaussian optimizers for entropic inequalities in quantum information

We survey the state of the art for the proof of the quantum Gaussian opt...

ACSS-q: Algorithmic complexity for short strings via quantum accelerated approach

In this research we present a quantum circuit for estimating algorithmic...