Algorithmic No-Cloning Theorem
| Autor: | Samuel Epstein |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Inequality Computer science media_common.quotation_subject FOS: Physical sciences 02 engineering and technology Computational Complexity (cs.CC) Library and Information Sciences Unitary state Entropy (classical thermodynamics) POVM Quantum state 0202 electrical engineering electronic engineering information engineering Entropy (information theory) Quantum information Entropy (energy dispersal) Quantum Entropy (arrow of time) Randomness media_common Discrete mathematics Quantum Physics Kolmogorov complexity Entropy (statistical thermodynamics) 020206 networking & telecommunications Mutual information Computer Science Applications Computer Science - Computational Complexity Quantum Physics (quant-ph) No-cloning theorem Information Systems Entropy (order and disorder) |
| Zdroj: | IEEE Transactions on Information Theory. 65:5925-5930 |
| ISSN: | 1557-9654 0018-9448 |
| DOI: | 10.1109/tit.2019.2910562 |
| Popis: | 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. 12 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|