Quantum Kolmogorov complexity and information-disturbance theorem

DOI10.3390/E13040778MaRDI QIDQ657557zbMATH OpenOpenAlexFDO

Authors 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 principleinformation-disturbance theoremquantum Kolmogorov complexity

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94)

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.

Recommendations

• QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Quantum Kolmogorov complexity
• Quantum algorithmic entropy
• Quantum Kolmogorov complexity based on classical descriptions

Cites work

• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 1542869 (Why is no real title available?)
• A proof of the security of quantum key distribution
• A single quantum cannot be cloned
• Can a Universal Quantum Computer Be Fully Quantum?
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Information vs. disturbance in dimension D
• No-cloning theorem on quantum logics
• On Halting Process of Quantum Turing Machine
• On the Length of Programs for Computing Finite Binary Sequences
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
• Quantum Complexity Theory
• Quantum Kolmogorov complexity
• Quantum Kolmogorov complexity based on classical descriptions
• Quantum algorithmic entropy
• Quantum cryptography based on Bell’s theorem
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
• Three approaches to the quantitative definition of information^*

Cited in

(3)

• An extended coding theorem with application to quantum complexities
• Quantum Kolmogorov complexity
• Quantum information and the PCP theorem

This page was built for publication: Quantum Kolmogorov complexity and information-disturbance theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657557)