Quantum Kolmogorov Complexity and Bounded Quantum Memory
arXiv:1101.4993 · doi:10.1103/PhysRevA.83.042316
Abstract
In this study, the effect of bounded quantum memory in a primitive information protocol has been examined using the quantum Kolmogorov complexity as a measure of information. We employed a toy two-party protocol in which Bob by using a bounded quantum memory and an unbounded classical memory estimates a message that was encoded in qubits by Alice in one of the bases X or Z. Our theorem gave a nontrivial effect of the memory boundedness. In addition, a generalization of the uncertainty principle in the presence of quantum memory has been obtained.
8 pages
References in corpus (5)
- 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 Quantum Key Distribution
- Quantum Kolmogorov Complexity and Information-Disturbance Theorem