Smooth Rényi Entropy of Ergodic Quantum Information Sources

2007/04/26 by Berry Schoenmakers, Schoenmakers, Berry, Jilles Tjoelker +5 · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum chaos and dynamical systems

paper · pdf · doi:10.48550/arxiv.0704.3504

Abstract

We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic information source, which is equal to the Shannon entropy rate for a classical information source and the von Neumann entropy rate for a quantum information source.

Cited by

• A noncommutative Ruelle's Theorem for a normalized potential taking values on positivity-improving operators

Related

• Renyi Entropy Rate of Stationary Ergodic Processes
• A Framework for Non-Asymptotic Quantum Information Theory
• Asymptotic Expansions of Smooth Rényi Entropies and Their Applications
• The Data Compression Theorem for Ergodic Quantum Information Sources
• Renyi extrapolation of Shannon entropy