Entropy and algorithmic complexity in quantum information theory (Q885683): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quantum Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of dynamical entropies for the noncommutative shifts / 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: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shannon-McMillan theorem for ergodic quantum lattice systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3314114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806962 / 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: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In What Sense is the Kolmogorov-Sinai Entropy a Measure for Chaotic Behaviour?—Bridging the Gap Between Dynamical Systems Theory and Communication Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithmic entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical basis for information theory and probability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can an individual sequence of zeros and ones be random? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Kolmogorov complexity based on classical descriptions / rank
 
Normal rank

Latest revision as of 10:03, 26 June 2024

scientific article
Language Label Description Also known as
English
Entropy and algorithmic complexity in quantum information theory
scientific article

    Statements

    Entropy and algorithmic complexity in quantum information theory (English)
    0 references
    14 June 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithmic complexity
    0 references
    classical and quantum information
    0 references
    0 references
    0 references