The information spectrum approach gives general formulae for optimal rates of codes in many areas of information theory. In this paper the quantum spectral divergence rates are defined and properties of the rates are derived. The entropic rates, conditional entropic rates, and spectral mutual information rates are then defined in terms of the spectral divergence rates. Properties including subadditivity, chain rules, Araki-Lieb inequalities, and monotonicity are then explored.
The information spectrum approach gives general formulae for optimal rates of codes in many areas of information theory. In this paper the quantum spectral divergence rates are defined and properties of the rates are derived. The entropic rates, conditional entropic rates, and spectral mutual information rates are then defined in terms of the spectral divergence rates. Properties including subadditivity, chain rules, Araki-Lieb inequalities, and monotonicity are then explored.
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.
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.
One of the principal themes of information theory is to establish a link between two different kinds of quantities: one is an operational quantity which is defined through the asymptotic optimality on some concrete concept such as code length, compression rate, error probability, etc., while the other is an abstract information quantity such as the entropy, divergence, mutual information, etc. The same theme is now being pursued extensively in quantum information theory, and lots of mathematical results have been reported so far. In the so-called information-spectrum methods in the classical information theory [1], the process of establishing a link between an operatinal quantity and an entropy-like information quantity is intentionally divided into two parts, making the third kind of quantities — information spectrum — intervene. In the methods, the asymptotic optimality of an operational quantity is characterized by a limiting expression on information spectra (asymptotic behavior of logarithmic likelihoods) in the most general setting, while the information-spectrum quantity is rewritten to an entropylike quantity in a specific situation mostly as a direct consequence of a limiting theorem in the probability theory such as the law of large numbers, the Shannon-McMillan-Breiman theorem, etc. Such a framework brings not only generality but also transparency of mathematical arguments. Extending the information-spectrum methods to the quantum case is an attractive subject, which is expected to provide both the asymptotic optimality of operational quantities and the limiting law governing quantum stochastic situations with transparent and comprehensive understanding. In this talk I would like to review recent attempts to develop the quantum informationspectrum methods made by Hayashi, Ogawa and myself, mainly based on [2, 3, 4], and discuss their significance in the quantum information theory.
Quantum generalizations of Rényi's entropies are a useful tool to describe a variety of operational tasks in quantum information processing. Two families of such generalizations turn out to be particularly useful: the Petz quantum Rényi divergence Dˉα and the minimal quantum Rényi divergence Dα. Moreover, the maximum quantum Rényi divergence Dα is of particular mathematical interest. In this Master thesis, we investigate relations between these divergences and their applications in quantum information theory. Our main result is a reverse Araki-Lieb-Thirring inequality that implies a new relation between the minimal and the Petz divergence, namely that αDˉα(ρ∥σ)⩽Dα(ρ∥σ) for α∈[0,1] and where ρ and σ are density operators. This bound suggests defining a "pretty good fidelity", whose relation to the usual fidelity implies the known relations between the optimal and pretty good measurement as well as the optimal and pretty good singlet fraction. In addition, we provide a new proof of the inequality D1(ρ∥σ)⩽D1(ρ∥σ), based on the Araki-Lieb-Thirring inequality. This leads to an elegant proof of the logarithmic form of the reverse Golden-Thompson inequality.
We propose a conceptually simple method for proving various entropic inequalities by means of spectral estimates. Our approach relies on a two-sided estimate of the relative entropy between two quantum states in terms of certain variance-type quantities. As an application of this estimate, we answer three important problems in quantum information theory and dissipative quantum systems that were left open until now: first, we prove the existence of strictly contractive constants for the strong data processing inequality for quantum channels that satisfy a notion of detailed balance. Second, we prove the existence of the complete modified logarithmic Sobolev constant which controls the exponential entropic convergence of a quantum Markov semigroup towards its equilibrium. Third, we prove a new generalization of the strong subadditivity of the entropy for the relative entropy distance to a von Neumann algebra under a specific gap condition. All the three results obtained are independent of the size of the environment.