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.
The Rényi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies, or mutual information, and have found many applications in information theory and beyond. Various generalizations of Rényi entropies to the quantum setting have been proposed, most prominently Petz's quasi-entropies and Renner's conditional min-, max-, and collision entropy. However, these quantum extensions are incompatible and thus unsatisfactory. We propose a new quantum generalization of the family of Rényi entropies that contains the von Neumann entropy, min-entropy, collision entropy, and the max-entropy as special cases, thus encompassing most quantum entropies in use today. We show several natural properties for this definition, including data-processing inequalities, a duality relation, and an entropic uncertainty relation.
The R\'enyi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies or mutual information, and have found many applications in information theory and beyond. Various generalizations of R\'enyi entropies to the quantum setting have been proposed, most notably Petz's quasi-entropies and Renner's conditional min-, max- and collision entropy. Here, we argue that previous quantum extensions are incompatible and thus unsatisfactory.
We propose a new quantum generalization of the family of R\'enyi entropies and the corresponding relative entropies that contains the min-entropy, collision entropy, von Neumann entropy as well as the max-entropy as special cases, thus encompassing most quantum entropies in use today. We show several natural properties for this definition, including data-processing inequalities and a limited duality relation.
We conclude that the treatment of these entropies is technically challenging and requires sophisticated tools from linear algebra. We share several conjectured properties which we were unable to prove.
Abstract Chapter 20 provides a discussion of entropies and entropic quantities in quantum information theory, briefly considering the generalizations of the Rényi entropy to the quantum regime, but mainly focusing on the von Neumann entropy and its properties such as concavity, the Araki-Lieb inequality, and subadditivity. We introduce the quantum relative entropy, quantum joint entropy, quantum conditional entropy, and quantum mutual information, and prove key properties and results for these quantities, including Klein’s inequality, joint convexity, additivity, and monotonicity under completely positive and trace-preserving maps of the relative entropy, as well as weak monotonicity and strong subadditivity of the von Neumann entropy. We then analyse the relation of (negative) conditional entropy and entanglement. In this context we discuss the conditional amplitude operator and the mutual amplitude operator, as well as conditional Rényi entropies and their role for entanglement detection.
Quantum R\'enyi relative entropies play a significant part in characterizing operational tasks in quantum information theory. In this paper, we first give some fundamental properties of the zero-relative entropy, and we find that the geometric R\'enyi relative entropy reduces to the zero-relative entropy in the limit case. Then, we define a new mutual information via the zero-relative entropy, and it is the so-called zero-mutual information. In particular, the zero-mutual information is a lower bound of the Petz-R\'enyi and geometric generalized mutual information. We establish the chain rules for the unsmoothed and smoothed versions of the zero-mutual information. As an application, we discuss generalized mutual information with the Petz-R\'enyi, sandwiched R\'enyi, and geometric R\'enyi types, our result gives a uniform chain rule inequality for quantum generalized mutual information.
Quantum generalizations of the Fisher information are important in quantum information science, with applications in high energy and condensed matter physics and in quantum estimation theory, machine learning, and optimization. One can derive a quantum generalization of the Fisher information matrix in a natural way as the Hessian matrix arising in a Taylor expansion of a smooth divergence. Such an approach is appealing for quantum information theorists, given the ubiquity of divergences in quantum information theory. In contrast to the classical case, there is not a unique quantum generalization of the Fisher information matrix, similar to how there is not a unique quantum generalization of the relative entropy or the Rényi relative entropy. In this paper, I derive information matrices arising from the log-Euclidean, α-z, and geometric Rényi relative entropies, with the main technical tool for doing so being the method of divided differences for calculating matrix derivatives. Interestingly, for all non-negative values of the Rényi parameter α, the log-Euclidean Rényi relative entropy leads to the Kubo-Mori information matrix, and the geometric Rényi relative entropy leads to the right-logarithmic derivative Fisher information matrix. Thus, the resulting information matrices obey the data-processing inequality for all non-negative values of the Rényi parameter α even though the original quantities do not. Additionally, I derive and establish basic properties of α-z information matrices resulting from the α-z Rényi relative entropies. For parameterized thermal states and time-evolved states, I establish formulas for their α-z information matrices and hybrid quantum-classical algorithms for estimating them, with applications in quantum Boltzmann machine learning.
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.