CiteULike
Facebook
Mendeley
Twitter
This article is- freely available
- re-usable
Entropy 2011, 13(4), 778-789; doi:10.3390/e13040778
Article
Quantum Kolmogorov Complexity and Information-Disturbance Theorem
Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Daibiru building 1003, Sotokanda, Chiyoda-ku, Tokyo, 101-0021, Japan
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)
Download PDF Full-Text [150 KB, uploaded 29 March 2011 11:17 CEST]
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
Article Statistics
Click here to load and display the download statistics.Cite This Article
MDPI and ACS Style
Miyadera, T. Quantum Kolmogorov Complexity and Information-Disturbance Theorem. Entropy 2011, 13, 778-789.
AMA StyleMiyadera T. Quantum Kolmogorov Complexity and Information-Disturbance Theorem. Entropy. 2011; 13(4):778-789.
Chicago/Turabian StyleMiyadera, Takayuki. 2011. "Quantum Kolmogorov Complexity and Information-Disturbance Theorem." Entropy 13, no. 4: 778-789.