Quantum Kolmogorov complexity and information-disturbance theorem

DOI10.3390/e13040778zbMath1229.81068arXiv1101.2946MaRDI QIDQ657557

Takayuki Miyadera

Publication date: 9 January 2012

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.2946

zbMATH Keywords

uncertainty principle; quantum Kolmogorov complexity; information-disturbance theorem

Mathematics Subject Classification ID

81P94: Quantum cryptography (quantum-theoretic aspects)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of the security of quantum key distribution
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Quantum algorithmic entropy
• On Halting Process of Quantum Turing Machine
• QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
• No-cloning theorem on quantum logics
• Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Complexity Theory
• Quantum cryptography based on Bell’s theorem
• Can a Universal Quantum Computer Be Fully Quantum?
• Quantum Kolmogorov complexity based on classical descriptions
• A single quantum cannot be cloned
• Three approaches to the quantitative definition of information^*
• On the Length of Programs for Computing Finite Binary Sequences
• Quantum Kolmogorov complexity