Properties of noncommutative Rényi and Augustin information

DOI10.1007/S00220-022-04319-8zbMATH Open1484.94010arXiv1811.04218OpenAlexW2900230570MaRDI QIDQ2113490FDOQ2113490

Li Gao, Hao-Chung Cheng, Min-Hsiu Hsieh

Publication date: 14 March 2022

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: R'enyi and Augustin information are generalizations of mutual information defined via the R'enyi divergence, playing a significant role in evaluating the performance of information processing tasks by virtue of its connection to the error exponent analysis. In quantum information theory, there are three generalizations of the classical R'enyi divergence -- the Petz's, sandwiched, and log-Euclidean versions, that possess meaningful operational interpretation. However, the associated quantum R'enyi and Augustin information are much less explored compared with their classical counterpart, and lacking crucial properties hinders applications of these quantities to error exponent analysis in the quantum regime. The goal of this paper is to analyze fundamental properties of the R'enyi and Augustin information from a noncommutative measure-theoretic perspective. Firstly, we prove the uniform equicontinuity for all three quantum versions of R'enyi and Augustin information, and it hence yields the joint continuity of these quantities in order and prior input distributions. Secondly, we establish the concavity of the scaled R'enyi and Augustin information in the region of $sin(-1,0)$ for both Petz's and the sandwiched versions. This completes the open questions raised by Holevo [IEEE Trans.~Inf.~Theory, 46(6):2256--2261, 2000], and Mosonyi and Ogawa [Commun.~Math.~Phys., 355(1):373--426, 2017]. For the applications, we show that the strong converse exponent in classical-quantum channel coding satisfies a minimax identity, which means that the strong converse exponent can be attained by the best constant composition code. The established concavity is further employed to prove an entropic duality between classical data compression with quantum side information and classical-quantum channel coding, and a Fenchel duality in joint source-channel coding with quantum side information.

Full work available at URL: https://arxiv.org/abs/1811.04218

zbMATH Keywords

mutual informationRényi divergence

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions
• Quantum Sphere-Packing Bounds With Polynomial Prefactors
• Reliability Criteria in Information Theory and in Statistical Hypothesis Testing
• Ged�chtnisfreie Kan�le f�r diskrete Zeit
• A Mathematical Theory of Communication
• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex Analysis
• Title not available (Why is that?)
• Generalized s-numbers of \(\tau\)-measurable operators
• Large deviations of estimators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The capacity of the quantum channel with general signal states
• Title not available (Why is that?)
• The factorization of operator valued functions
• Applications of the complex interpolation method to a von Neumann algebra: non-commutative \(L^ p\)-spaces
• Statistical decision theory. Foundations, concepts, and methods
• Title not available (Why is that?)
• Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels
• On general minimax theorems
• Quasi-entropies for finite quantum systems
• Second-order asymptotics for quantum hypothesis testing
• Title not available (Why is that?)
• CLARKSON INEQUALITIES WITH SEVERAL OPERATORS
• Title not available (Why is that?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• On an inequality of Lieb and Thirring
• Hypothesis testing and information theory
• Title not available (Why is that?)
• Doobs inequality for non-commutative martingales
• Title not available (Why is that?)
• Generalized cutoff rates and Renyi's information measures
• On the reliability function for a quantum communication channel.
• Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
• Rényi Divergence and Kullback-Leibler Divergence
• General formulas for capacity of classical-quantum channels
• Title not available (Why is that?)
• Channel Coding Rate in the Finite Blocklength Regime
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• Sandwiched Rényi divergence satisfies data processing inequality
• On quantum Rényi entropies: A new generalization and some properties
• Quantum Information Processing with Finite Resources
• Conditional expectation in an operator algebra. IV. Entropy and information
• Title not available (Why is that?)
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• Information Theory
• Strong converse and Stein's lemma in quantum hypothesis testing
• The method of types [information theory]
• Rates of Convergence of Estimates and Test Statistics
• Title not available (Why is that?)
• Mixed-norm inequalities and operator space 𝐿_{𝑝} embedding theory
• Noncommutative maximal ergodic theorems
• Title not available (Why is that?)
• A simple derivation of the coding theorem and some applications
• Lower bounds to error probability for coding on discrete memoryless channels. I
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• Norm inequalities related to operator monotone functions
• Noiseless coding of correlated information sources
• Large-Sample Theory: Parametric Case
• Refinement of the Random Coding Bound
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factorization of operator valued analytic functions
• Rényi divergences as weighted non-commutative vector-valued \(L_p\)-spaces
• Rényi relative entropies and noncommutative \(L_p\)-spaces
• Title not available (Why is that?)
• The role of duality in optimization problems involving entropy functionals with applications to information theory
• Strong converse exponent for classical-quantum channel coding
• Information radius
• Hölder estimates for the noncommutative Mazur maps
• Graph decomposition: A new key to coding theorems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Good codes can be produced by a few permutations
• Error estimates for low rate codes
• Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
• Matrix inequalities from a two variables functional
• Title not available (Why is that?)
• Moderate Deviations in Channel Coding
• The sphere packing bound for memoryless channels
• Two variables functionals and inequalities related to measurable operators
• Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations
• Reliability function of general classical-quantum channel
• Correlation detection and an operational interpretation of the Rényi mutual information
• Applications of position-based coding to classical communication over quantum channels
• Polar Codes in Network Quantum Information Theory
• Coding Theorems for Compound Problems via Quantum Rényi Divergences
• The Augustin capacity and center
• Storing and transmitting data. Rudolf Ahlswede's lectures on information theory 1. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm
• Concavity of the Auxiliary Function for Classical-Quantum Channels
• Refinement of the Sphere-Packing Bound: Asymmetric Channels
• Linear codes for sources and source networks: Error exponents, universal coding
• Towards a general theory of source networks
• Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing
• Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
• The Sphere Packing Bound via Augustin’s Method
• The Rényi Capacity and Center
• Title not available (Why is that?)
• Non-Asymptotic Classical Data Compression With Quantum Side Information

Cited In (1)

• A generalized Rényi divergence for multi-source information fusion with its application in EEG data analysis

This page was built for publication: Properties of noncommutative Rényi and Augustin information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113490)