We consider two fundamental tasks in quantum information theory, data compression with quantum side information, as well as randomness extraction against quantum side information. We characterize these tasks for general sources using so-called one-shot entropies. These characterizations-in contrast to earlier results-enable us to derive tight second-order asymptotics for these tasks in the i.i.d. limit. More generally, our derivation establishes a hierarchy of information quantities that can be used to investigate information theoretic tasks in the quantum domain: The one-shot entropies most accurately describe an operational quantity, yet they tend to be difficult to calculate for large systems. We show that they asymptotically agree (up to logarithmic terms) with entropies related to the quantum and classical information spectrum, which are easier to calculate in the i.i.d. limit. Our technique also naturally yields bounds on operational quantities for finite block lengths.We consider two fundamental tasks in quantum information theory, data compression with quantum side information, as well as randomness extraction against quantum side information. We characterize these tasks for general sources using so-called one-shot entropies. These characterizations-in contrast to earlier results-enable us to derive tight second-order asymptotics for these tasks in the i.i.d. limit. More generally, our derivation establishes a hierarchy of information quantities that can be used to investigate information theoretic tasks in the quantum domain: The one-shot entropies most accurately describe an operational quantity, yet they tend to be difficult to calculate for large systems. We show that they asymptotically agree (up to logarithmic terms) with entropies related to the quantum and classical information spectrum, which are easier to calculate in the i.i.d. limit. Our technique also naturally yields bounds on operational quantities for finite block lengths.

arXiv:1208.1478IEEE Transactions on Information TheoryAug 2, 2013280 citations

Some applications of matrix inequalities in Rényi entropy

Hadi Reisizadeh, Seyed Mahmoud Manjegani

The R{é}nyi entropy is one of the important information measures that generalizes Shannon's entropy. The quantum R{é}nyi entropy has a fundamental role in quantum information theory, therefore, bounding this quantity is of vital importance. Another important quantity is R{é}nyi relative entropy on which R{é}nyi generalization of the conditional entropy, and mutual information are defined based. Thus, finding lower bound for R{é}nyi relative entropy is our goal in this paper. We use matrix inequalities to prove new bounds on the entropy of type $β$ , R{é}nyi entropy.The R{é}nyi entropy is one of the important information measures that generalizes Shannon's entropy. The quantum R{é}nyi entropy has a fundamental role in quantum information theory, therefore, bounding this quantity is of vital importance. Another important quantity is R{é}nyi relative entropy on which R{é}nyi generalization of the conditional entropy, and mutual information are defined based. Thus, finding lower bound for R{é}nyi relative entropy is our goal in this paper. We use matrix inequalities to prove new bounds on the entropy of type $β$, R{é}nyi entropy.

arXiv:1608.03362Aug 11, 20160 citations

Quantum Entropy and Information

Nilanjana Datta

Lecture notes in physicsJan 1, 20103 citations

A limit of the quantum Renyi divergence

Nilanjana Datta, Felix Leditzky

Recently, an interesting quantity called the quantum Renyi divergence (or "sandwiched" Renyi relative entropy) was defined for pairs of positive semi-definite operators $\rho$ and $\sigma$ . It depends on a parameter $\alpha$ and acts as a parent quantity for other relative entropies which have important operational significances in quantum information theory: the quantum relative entropy and the min- and max-relative entropies. There is, however, another relative entropy, called the 0-relative Renyi entropy, which plays a key role in the analysis of various quantum information-processing tasks in the one-shot setting. We prove that the 0-relative Renyi entropy is obtainable from the quantum Renyi divergence only if $\rho$ and $\sigma$ have equal supports. This, along with existing results in the literature, suggests that it suffices to consider two essential parent quantities from which operationally relevant entropic quantities can be derived - the quantum Renyi divergence with parameter $\alpha \ge 1/2$ , and the $\alpha$ -relative R\'enyi entropy with $\alpha\in [0,1)$ .Recently, an interesting quantity called the quantum Renyi divergence (or "sandwiched" Renyi relative entropy) was defined for pairs of positive semi-definite operators $\rho$ and $\sigma$. It depends on a parameter $\alpha$ and acts as a parent quantity for other relative entropies which have important operational significances in quantum information theory: the quantum relative entropy and the min- and max-relative entropies. There is, however, another relative entropy, called the 0-relative Renyi entropy, which plays a key role in the analysis of various quantum information-processing tasks in the one-shot setting. We prove that the 0-relative Renyi entropy is obtainable from the quantum Renyi divergence only if $\rho$ and $\sigma$ have equal supports. This, along with existing results in the literature, suggests that it suffices to consider two essential parent quantities from which operationally relevant entropic quantities can be derived - the quantum Renyi divergence with parameter $\alpha \ge 1/2$, and the $\alpha$-relative R\'enyi entropy with $\alpha\in [0,1)$.

Jan 1, 201324 citations

Quantum Information and Entropy

Subhash C. Kak

arXiv:quant-ph/0605096International Journal of Theoretical PhysicsFeb 22, 2007136 citations

β

, R{é}nyi entropy.

Recently, an interesting quantity called the quantum Renyi divergence (or "sandwiched" Renyi relative entropy) was defined for pairs of positive semi-definite operators

\rho

and

\sigma

. It depends on a parameter

\alpha

and acts as a parent quantity for other relative entropies which have important operational significances in quantum information theory: the quantum relative entropy and the min- and max-relative entropies. There is, however, another relative entropy, called the 0-relative Renyi entropy, which plays a key role in the analysis of various quantum information-processing tasks in the one-shot setting. We prove that the 0-relative Renyi entropy is obtainable from the quantum Renyi divergence only if

\rho

and

\sigma

have equal supports. This, along with existing results in the literature, suggests that it suffices to consider two essential parent quantities from which operationally relevant entropic quantities can be derived - the quantum Renyi divergence with parameter

\alpha \ge 1/2

, and the

\alpha

-relative R\'enyi entropy with

\alpha\in [0,1)