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