Quantum Kolmogorov complexity and information-disturbance theorem

DOI10.3390/E13040778zbMATH Open1229.81068arXiv1101.2946OpenAlexW2072328681MaRDI QIDQ657557FDOQ657557

Authors: Takayuki Miyadera 

Publication date: 9 January 2012

Published in: Entropy (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

uncertainty principleinformation-disturbance theoremquantum Kolmogorov complexity

Mathematics Subject Classification ID

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

Cites Work

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

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)