DeepAI AI Chat
Log In Sign Up

Algorithmic No-Cloning Theorem

08/09/2018
by   Samuel Epstein, et al.
Apple, Inc.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/07/2021

On the Algorithmic Content of Quantum Measurements

We show that given a quantum measurement, for an overwhelming majority o...
03/11/2023

A Quantum Outlier Theorem

In recent results, it has been proven that all sampling methods produce ...
03/13/2023

On the Algorithmic Information Between Probabilities

We extend algorithmic conservation inequalities to probability measures....
04/05/2018

Agents, subsystems, and the conservation of information

Dividing the world into subsystems is an important component of the scie...
11/13/2019

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...
03/06/2018

Gaussian optimizers for entropic inequalities in quantum information

We survey the state of the art for the proof of the quantum Gaussian opt...
09/18/2020

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

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