Quantum Generalization of Conditional Entropy and Information

Lev B. Levitin

The concepts of conditional entropy of a physical system given the state of another system and of information in a physical system about another one are generalized for quantum systems. The fundamental difference between the classical case and the quantum one is that the entropy and information in quantum systems depend on the choice of measurements performed over the systems. It is shown that some equalities of the classical information theory turn into inequalities for the generalized quantities. Specific quantum phenomena such as EPR pairs and superdense coding are described and explained in terms of the generalized conditional entropy and information.

Nilanjana Datta

Mario Berta, Kaushik Parasuram Seshadreesan, Mark M. Wilde

Quantum information measures such as the entropy and the mutual information find applications in physics, e.g., as correlation measures. Generalizing such measures based on the R\'enyi entropies is expected to enhance their scope in applications. We prescribe R\'enyi generalizations for any quantum information measure which consists of a linear combination of von Neumann entropies with coefficients chosen from the set $\left\{\ensuremath{-}1,0,1\right\}$. As examples, we describe R\'enyi generalizations of the conditional quantum mutual information, some quantum multipartite information measures, and the topological entanglement entropy. Among these, we discuss the various properties of the R\'enyi conditional quantum mutual information and sketch some potential applications. We conjecture that the proposed R\'enyi conditional quantum mutual informations are monotone increasing in the R\'enyi parameter, and we have proof of this conjecture for some special cases.

Subhash C. Kak

Olga V. Man’ko

Yodai Watanabe

Randomness extraction against side information is the art of distilling from a given source a key which is almost uniform conditioned on the side information. This paper provides randomness extraction against quantum side information whose extractable key length is given by a quantum generalization of the collision entropy, which is smoothed and conditioned differently from how this is done in existing schemes. Based on the fact that the collision entropy is not subadditive, its optimization with respect to additional side information is introduced, and is shown to be asymptotically optimal. The lower bound derived there for general states is expressed as the difference between two unconditional entropies and its evaluation reduces to an eigenvalue problem of two states, which are the entire state and the marginal state of side information.