Elements of information theory
Elements of information theory
Quantum computation and quantum information
Quantum computation and quantum information
Smooth entropies and the quantum information spectrum
IEEE Transactions on Information Theory
The operational meaning of min- and max-entropy
IEEE Transactions on Information Theory
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On quantum fidelities and channel capacities
IEEE Transactions on Information Theory
Strong converse and Stein's lemma in quantum hypothesis testing
IEEE Transactions on Information Theory
Duality between smooth min- and max-entropies
IEEE Transactions on Information Theory
The quantum capacity of channels with arbitrarily correlated noise
IEEE Transactions on Information Theory
A conceptually simple proof of the quantum reverse Shannon theorem
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Robust cryptography in the noisy-quantum-storage model
Quantum Information & Computation
An intuitive proof of the data processing inequality
Quantum Information & Computation
| Hi-index | 754.96 |
The classical asymptotic equipartition property is the statement that, in the limit of a large number of identical repetitions of a random experiment, the output sequence is virtually certain to come from the typical set, each member of which is almost equally likely. In this paper, a fully quantum generalization of this property is shown, where both the output of the experiment sand side information are quantum. An explicit bound on the convergence is given, which is independent of the dimensionality of the side information. This naturally leads to a family of Rényi-like quantum conditional entropies, for which the von Neumann entropy emerges as a special case.