Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Data processing inequality
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We prove a number of quantitative stability bounds for the cases of equality in Petz’s monotonicity theorem for quasi-relative… Expand
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high… Expand
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Sandwiched (quantum) α-Renyi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for… Expand
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-R\'{e}nyi maximal correlation of a pair of… Expand
Is this relevant?
2013
2013
An intuitive outer bound for the multiterminal source coding problem is given. The proposed bound explicitly couples the rate… Expand
Is this relevant?
2012
2012
The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a connection between this bound and… Expand
Is this relevant?
2012
2012
The data processing inequality (DPI) is a fundamental feature of information theory. Informally it states that you cannot… Expand
Is this relevant?
2012
2012
Quantum data processing inequality bounds the set of bipartite states that can be generated by two far apart parties under local… Expand
Is this relevant?
2011
2011
In the distributed coding of correlated sources, the problem of characterizing the joint probability distribution of a pair of… Expand
Is this relevant?
2010
2010
We consider the quantum f-relative entropy where f is an operator convex function. We define a family of operator convex… Expand
Is this relevant?