Quantum Kolmogorov Complexity and Information-Disturbance Theorem
arXiv:1101.2946 · doi:10.3390/e13040778
Abstract
In this paper, a representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by P. Vitanyi 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 quantitative relationships between complexities have been derived.
Special issue: Kolmogorov Complexity
References in corpus (8)
- Heisenberg's uncertainty principle for simultaneous measurement of positive-operator-valued measures
- On Halting Process of Quantum Turing Machine
- Generalized Landau-Pollak Uncertainty Relation
- Quantum Kolmogorov Complexity and the Quantum Turing Machine
- Information-Disturbance Theorem for Mutually Unbiased Observables
- No-Cloning Theorem on Quantum Logics
- Quantum Kolmogorov Complexity and Quantum Key Distribution
- Information-Disturbance theorem and Uncertainty Relation