Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Smooth entropy and Rényi entropy
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Secure identification and QKD in the bounded-quantum-storage model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Simple and tight bounds for information reconciliation and privacy amplification
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Coding theorem and strong converse for quantum channels
IEEE Transactions on Information Theory
Strong converse and Stein's lemma in quantum hypothesis testing
IEEE Transactions on Information Theory
General formulas for capacity of classical-quantum channels
IEEE Transactions on Information Theory
General formulas for fixed-length quantum entanglement concentration
IEEE Transactions on Information Theory
An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
IEEE Transactions on Information Theory
Asymptotic Entanglement Manipulation of Bipartite Pure States
IEEE Transactions on Information Theory
Min- and max-relative entropies and a new entanglement monotone
IEEE Transactions on Information Theory
The operational meaning of min- and max-entropy
IEEE Transactions on Information Theory
A fully quantum asymptotic equipartition property
IEEE Transactions on Information Theory
Capacity with energy constraint in coherent state channel
IEEE Transactions on Information Theory
Duality between smooth min- and max-entropies
IEEE Transactions on Information Theory
Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
Quantum Information Processing
| Hi-index | 755.14 |
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.