Quantum Kolmogorov complexity and information-disturbance theorem (Q657557)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quantum Kolmogorov complexity and information-disturbance theorem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum Kolmogorov complexity and information-disturbance theorem |
scientific article |
Statements
Quantum Kolmogorov complexity and information-disturbance theorem (English)
0 references
9 January 2012
0 references
Summary: A representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by \textit{P. M. B. Vitányi} [IEEE Trans. Inf. Theory 47, No.~6, 2464--2479 (2001; Zbl 1021.94006)] is 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.
0 references
quantum Kolmogorov complexity
0 references
information-disturbance theorem
0 references
uncertainty principle
0 references
0 references
0.7802367806434631
0 references
0.7579594254493713
0 references
0.7350074648857117
0 references
0.7348266243934631
0 references
0.7261198163032532
0 references