We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures. Through the introduction of the [Formula: see text]-[Formula: see text]-Rényi relative entropies, which comprise known relevant quantities such as the Rényi relative entropy and the sandwiched Rényi relative entropy, we establish the Holevo–Rényi inequality. This result leads to a quantum bound for the [Formula: see text]-mutual information, suggesting new insights into communication channel performance and the fundamental limits for reliability functions in memoryless multi-letter communication channels.
We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures. Through the introduction of the [Formula: see text]-[Formula: see text]-Rényi relative entropies, which comprise known relevant quantities such as the Rényi relative entropy and the sandwiched Rényi relative entropy, we establish the Holevo–Rényi inequality. This result leads to a quantum bound for the [Formula: see text]-mutual information, suggesting new insights into communication channel performance and the fundamental limits for reliability functions in memoryless multi-letter communication channels.
Integral representations of quantum relative entropy, and of the directional second and higher order derivatives of von Neumann entropy, are established, and used to give simple proofs of fundamental, known data processing inequalities: the Holevo bound on the quantity of information transmitted by a quantum communication channel, and, much more generally, the monotonicity of quantum relative entropy under trace-preserving positive linear maps – complete positivity of the map need not be assumed. The latter result was first proved by Müller-Hermes and Reeb, based on work of Beigi. For a simple application of such monotonicities, we consider any `divergence' that is non-increasing under quantum measurements, such as the concavity of von Neumann entropy, or various known quantum divergences. An elegant argument due to Hiai, Ohya, and Tsukada is used to show that the infimum of such a `divergence' on pairs of quantum states with prescribed trace distance is the same as the corresponding infimum on pairs of binary classical states. Applications of the new integral formulae to the general probabilistic model of information theory, and a related integral formula for the classical Rényi divergence, are also discussed.
This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations of the optimal rates for quantum source coding, state redistribution, and measurement compression with quantum side information via second order asymptotic expansions and strong converse theorems. The dissertation consists of a mathematical and an information-theoretic part. In the mathematical part, we focus on the α-sandwiched Rényi divergence (α-SRD). We first investigate the limit α→0 to determine whether this recovers the well-known 0-Rényi relative divergence. We then prove various new results for entropic quantities derived from the α-SRD, including dimension bounds and useful bounds in terms of the fidelity between two quantum states. Furthermore, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality (viz. monotonicity under quantum operations) for the α-SRD, and give applications to entropic bounds. In the information-theoretic part, we first derive the second order asymptotics of visible quantum source coding using a mixed source. For the achievability part, we develop universal quantum source codes achieving a given second order rate for a memoryless source. As a corollary of the main result, we obtain the second order asymptotics of quantum source coding using a single memoryless source. We then prove strong converse theorems for state redistribution (with or without feedback) and measurement compression with quantum side information. The key ingredients in proving these theorems are the aforementioned fidelity bounds on Rényi entropic quantities derived from the α-SRD.
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.
Holevo introduced a fidelity between quantum states that is symmetric and as effective as the trace distance in evaluating their similarity. This fidelity is bounded by a function of the trace distance, a relationship to which we will refer as Holevo's inequality. More broadly, Holevo's fidelity is part of a one-parameter family of symmetric Petz-Rényi relative entropies, which in turn satisfy a Pinsker's-like inequality with respect to the trace distance. Although Holevo's inequality is tight, Pinsker's inequality is loose for this family. We show that the symmetric Petz-Rényi relative entropies satisfy a tight inequality with respect to the trace distance, improving Pinsker's and reproducing Holevo's as a specific case. Additionally, we show how this result emerges from a symmetric Petz-Rényi uncertainty relation, a result that encompasses several relations in quantum and stochastic thermodynamics.
For the sandwiched Rényi entropy the conditional entropy can be defined two ways: Hα↓(A∣B)ρ,Hα↑(A∣B)ρ. In the limiting case, α=1, both definitions consolidate into conditional entropy H(A∣B)=S(AB)−S(B). The continuity inequality for conditional entropy H(A∣B), called the Alicki-Fannes-Winter (AWF) inequality, shows that if the states are close in trace-distance, then the conditional entropies are also close. Having the AWF inequality for conditional entropy, we show that the channel entropy defined through the relative entropy is continuous with respect to the diamond-distance between channels. Inspired by this, similar continuity inequalities for the Rényi conditional entropy Hα↑ were obtained in the work [A. Marwah and F. Dupuis, J. Math. Phys. 63, 052201 (2022)]. We provide continuity bounds for the sandwiched Rényi and Tsallis conditional entropies Hα↓(A∣B)ρ,Tα↓(A∣B)ρ for states with the same marginal on the conditioning system. Similar to the previous bounds, our bound depends only on the dimension of the conditioning system. We apply this result to prove continuity of the channel entropy for Rényi and Tsallis channel entropies defined through the sandwiched Rényi and Tsallis relative entropies.
Abstract We establish a rigorous equivalence between quantum coherence measures defined by the sandwiched Rényi relative entropy and generalized conditional entropies associated with auxiliary quantum systems, providing a direct operational interpretation of sandwiched Rényi relative entropy of coherence as the conditional uncertainty of projective measurement outcomes with quantum memory. Motivated by this connection, we develop a coherence-based approach to quantum uncertainty relations. Within this approach, we introduce a coherence measure induced by the two-parameter α - z -Rényi relative entropy and derive corresponding uncertainty relations for both pure and mixed quantum states. The resulting state-independent bounds recover known results in appropriate limits and yield tighter bounds over a broad parameter regime. Our results provide a systematic connection between quantum coherence, generalized conditional entropies, and uncertainty relations, thereby offering a unified perspective on quantum uncertainty in terms of Rényi-type information measures.