Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q406105
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Fabio Benatti / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979697838 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0506080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computability / 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: 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: The data compression theorem for ergodic quantum information sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3314114 / 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: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithmic entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496240 / 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: Statistical Structure of Quantum Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Proof of the Quantum Noiseless Coding Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum redundancies and local realism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to weak universal source coding / 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: ALGORITHMIC COMPLEXITY OF QUANTUM STATES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Transition Functions of Quantum Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stationary quantum source coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Physical complexity of classical and quantum objects and their dynamical evolution from an information-theoretic viewpoint / 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: Complexity distortion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284061 / 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: Algorithmic complexity of points in dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding of sources with unknown statistics--I: Probability of encoding error / 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

Latest revision as of 11:18, 27 June 2024

scientific article
Language Label Description Also known as
English
Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
scientific article

    Statements

    Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references