Quantum Algorithmic Complexities and Entropy (Q3567165): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-state entanglement and quantum error correction / 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: The Shannon-McMillan theorem for ergodic quantum lattice systems / 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: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proper formula for relative entropy and its asymptotics in quantum probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy densities for algebraic states / 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: A Short Introduction to Quantum Information and Quantum Computation / 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: A formal theory of inductive inference. Part II / 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: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank

Revision as of 21:32, 2 July 2024

scientific article
Language Label Description Also known as
English
Quantum Algorithmic Complexities and Entropy
scientific article

    Statements

    Quantum Algorithmic Complexities and Entropy (English)
    0 references
    11 June 2010
    0 references
    0 references

    Identifiers