Sandwiched Rényi divergence satisfies data processing inequality

@article{Beigi2013SandwichedRD,
  title={Sandwiched R{\'e}nyi divergence satisfies data processing inequality},
  author={Salman Beigi},
  journal={Journal of Mathematical Physics},
  year={2013},
  volume={54},
  pages={122202-122202}
}
  • S. Beigi
  • Published 25 June 2013
  • Computer Science
  • Journal of Mathematical Physics
Sandwiched (quantum) α-Renyi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for the classical capacity of entanglement-breaking channels,” preprint arXiv:1306.1586 (2013)] and Muller-Lennert et al. [“On quantum Renyi entropies: a new definition, some properties and several conjectures,” preprint arXiv:1306.3142v1 (2013)]. This new quantum divergence has already found applications in quantum information theory. Here we further investigate… 
Inequalities for the quantum Renyi divergences with applications to compound coding problems
TLDR
Borders imply that the two versions of the conventional quantum Renyi divergences can be used interchangeably near alpha=1, and hence one can benefit from the best properties of both when proving coding theorems in the case of asymptotically vanishing error.
Coding Theorems for Compound Problems via Quantum Rényi Divergences
  • M. Mosonyi
  • Computer Science
    IEEE Transactions on Information Theory
  • 2015
TLDR
New and considerably simplified proofs are given for the achievability parts of Stein's lemma with composite null-hypothesis, universal state compression, and the classical capacity of compound classical-quantum channels, based on single-shot error bounds already available in the literature and simple properties of the quantum Rényi divergences.
Strong converse theorems using Rényi entropies
TLDR
For state redistribution, the strong converse property for the boundary of the entire achievable rate region in the (e, q)-plane is proved, where e and q denote the entanglement cost and quantum communication cost, respectively.
Optimized quantum f-divergences and data processing
  • M. Wilde
  • Computer Science
    Journal of Physics A: Mathematical and Theoretical
  • 2018
TLDR
The optimized quantum f-divergence is introduced as a related generalization of quantum relative entropy and it is proved that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz's original approach.
Strong Converse Exponent for Classical-Quantum Channel Coding
TLDR
The exact strong converse exponent of classical-quantum channel coding, for every rate above the Holevo capacity, is determined, an exact analogue of Arimoto’s, given as a transform of the Rényi capacities with parameters α>1.
Rényi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations
TLDR
A family of Rényi information exclusion relations is established and further generalisations and improvements to this and other known relations are provided, including the Rényu bipartite uncertainty relations.
Reliability Function of Quantum Information Decoupling via the Sandwiched R\'enyi Divergence
TLDR
This paper characterize the reliability function of catalytic quantum information decoupling, that is, the best exponential rate under which perfect decoupled is asymptotically approached, and derives the exact exponents for the smoothing of the conditional min-entropy and max-information and proves a novel bound for the convex-split lemma.
Relative entropies and their use in quantum information theory
TLDR
This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory, and proves strong converse theorems for state redistribution and measurement compression with quantum side information.
Optimized Quantum F-Divergences
  • M. Wilde
  • Computer Science
    2018 IEEE International Symposium on Information Theory (ISIT)
  • 2018
TLDR
The optimized quantum $f-divergence is introduced as a related generalization of quantum relative entropy and it is proved that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz's original approach.
Quantum Hypothesis Testing and the Operational Interpretation of the Quantum Rényi Relative Entropies
TLDR
This work shows that the new quantum extension of Rényi’s α-relative entropies have an operational interpretation in the strong converse problem of quantum hypothesis testing, and obtains a new simple proof for their monotonicity under completely positive trace-preserving maps.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
On quantum Rényi entropies: A new generalization and some properties
TLDR
This work proposes a new quantum generalization of the family of Renyi entropies that contains the von Neumann entropy, min-entropy, collision entropy, and the max-entropies as special cases, thus encompassing most quantum entropie in use today.
On quantum R\'enyi entropies: a new definition, some properties and several conjectures
TLDR
It is argued that previous quantum extensions are incompatible and thus unsatisfactory, and proposed a new quantum generalization that contains the min-entropy, collision entropy, von Neumann entropy as well as the max-entropies as special cases, thus encompassing most quantum entropies in use today.
Monotonicity of a relative Rényi entropy
We show that a recent definition of relative Renyi entropy is monotone under completely positive, trace preserving maps. This proves a recent conjecture of Muller-Lennert et al. [“On quantum Renyi
Notes on super-operator norms induced by schatten norms
TLDR
It is proved that if Φ is completely positive, the value of the supremum of the definition of ||Φ||q→p is achieved by a positive semidefinite operator X, answering a question recently posed by King and Ruskai.
On the Quantum Rényi Relative Entropies and Related Capacity Formulas
TLDR
It is shown that various generalizations of the Holevo capacity, defined in terms of the α-relative entropies, coincide for the parameter range α ∈ (0,2], and an upper bound on the one-shot ε-capacity of a classical-quantum channel interms of these capacities is given.
Strong Converse for the Classical Capacity of Entanglement-Breaking and Hadamard Channels via a Sandwiched Rényi Relative Entropy
TLDR
It is shown that a strong converse theorem holds for the classical capacity of all entanglement-breaking channels and all Hadamard channels (the complementary channels of the former) that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of communication exceeds the classical Capacity.
Arimoto channel coding converse and Rényi divergence
  • Yury Polyanskiy, S. Verdú
  • Computer Science
    2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2010
TLDR
A simple derivation of the Arimoto converse based on the data-processing inequality for Rényi divergence gives the simplest proof of the strong converse for the DMC with feedback and demonstrates that the sphere-packing bound is strictly tighter than Arimoto Converse for all channels, blocklengths and rates.
Asymptotic Error Rates in Quantum Hypothesis Testing
We consider the problem of discriminating between two different states of a finite quantum system in the setting of large numbers of copies, and find a closed form expression for the asymptotic
On general minimax theorems
There have been several generalizations of this theorem. J. Ville [9], A. Wald [11], and others [1] variously extended von Neumann's result to cases where M and N were allowed to be subsets of
...
1
2
3
4
...