Entropy 2011, 13(4), 778-789; doi:10.3390/e13040778

Quantum Kolmogorov Complexity and Information-Disturbance Theorem

Received: 17 January 2011; in revised form: 9 March 2011 / Accepted: 24 March 2011 / Published: 29 March 2011
(This article belongs to the Special Issue Kolmogorov Complexity)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: In this paper, a representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by P. Vit´anyi has been examined. In the quantum information theory, the information-disturbance relationship, which treats the trade-off relationship between information gain and its caused disturbance, is a fundamental result that is related to Heisenberg’s uncertainty principle. The problem was formulated in a cryptographic setting and the quantitative relationships between complexities have been derived.
Keywords: quantum Kolmogorov complexity; information-disturbance theorem; uncertainty principle
PDF Full-text Download PDF Full-Text [150 KB, uploaded 29 March 2011 11:17 CEST]

Export to BibTeX |

MDPI and ACS Style

Miyadera, T. Quantum Kolmogorov Complexity and Information-Disturbance Theorem. Entropy 2011, 13, 778-789.

AMA Style

Miyadera T. Quantum Kolmogorov Complexity and Information-Disturbance Theorem. Entropy. 2011; 13(4):778-789.

Chicago/Turabian Style

Miyadera, Takayuki. 2011. "Quantum Kolmogorov Complexity and Information-Disturbance Theorem." Entropy 13, no. 4: 778-789.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert