Quantum Kolmogorov complexity and information-disturbance theorem (Q657557): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072328681 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1101.2946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptography based on Bell’s theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three approaches to the quantitative definition of information<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Kolmogorov complexity based on classical descriptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithmic entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the security of quantum key distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can a Universal Quantum Computer Be Fully Quantum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Halting Process of Quantum Turing Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single quantum cannot be cloned / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-cloning theorem on quantum logics / rank
 
Normal rank

Latest revision as of 20:16, 4 July 2024

scientific article
Language Label Description Also known as
English
Quantum Kolmogorov complexity and information-disturbance theorem
scientific article

    Statements

    Quantum Kolmogorov complexity and information-disturbance theorem (English)
    0 references
    0 references
    0 references
    9 January 2012
    0 references
    Summary: A representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by \textit{P. M. B. Vitányi} [IEEE Trans. Inf. Theory 47, No.~6, 2464--2479 (2001; Zbl 1021.94006)] is 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 the quantitative relationships between complexities have been derived.
    0 references
    quantum Kolmogorov complexity
    0 references
    information-disturbance theorem
    0 references
    uncertainty principle
    0 references

    Identifiers