Smooth Entropies and the Quantum Information Spectrum
Authors:
- 19 May 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 55 (6) , 2807-2815
Abstract
Many of the traditional results in information theory, such as the channel coding theorem or the source coding theorem, are restricted to scenarios where the underlying resources are independent and identically distributed (i.i.d.) over a large number of uses. To overcome this limitation, two different techniques, the information spectrum method and the smooth entropy framework, have been developed independently. They are based on new entropy measures, called spectral entropy rates and smooth entropies, respectively, that generalize Shannon entropy (in the classical case) and von Neumann entropy (in the more general quantum case). Here, we show that the two techniques are closely related. More precisely, the spectral entropy rate can be seen as the asymptotic limit of the smooth entropy. Our results apply to the quantum setting and thus include the classical setting as a special case.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Secure Identification and QKD in the Bounded-Quantum-Storage Model2007
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications2007
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification2005
- General formulas for capacity of classical-quantum channelsIEEE Transactions on Information Theory, 2003
- Strong converse and Stein's lemma in quantum hypothesis testingIEEE Transactions on Information Theory, 2000
- Coding theorem and strong converse for quantum channelsIEEE Transactions on Information Theory, 1999
- Generalized privacy amplificationIEEE Transactions on Information Theory, 1995
- A general formula for channel capacityIEEE Transactions on Information Theory, 1994
- Approximation theory of output statisticsIEEE Transactions on Information Theory, 1993
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988