Exponent in Smoothing the Max-Relative Entropy and Its Application to Quantum Privacy Amplification

by   Ke Li, et al.

The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. In this paper, we derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy. We then apply this result to the problem of privacy amplification against quantum side information, and we obtain an upper bound for the exponent of the decreasing of the insecurity, measured using either purified distance or relative entropy. Our upper bound complements the earlier lower bound established by Hayashi, and the two bounds match when the rate of randomness extraction is above a critical value. Thus, for the case of high rate, we have determined the exact security exponent. Following this, we give examples and show that in the low-rate case, neither the upper bound nor the lower bound is tight in general. This exhibits a picture similar to that of the error exponent in channel coding.


page 1

page 2

page 3

page 4


Reliability Function of Quantum Information Decoupling

Quantum information decoupling is an important quantum information proce...

Total insecurity of communication via strong converse for quantum privacy amplification

Quantum privacy amplification is a central task in quantum cryptography....

Bounds on Lyapunov exponents

Lyapunov exponents describe the asymptotic behavior of the singular valu...

Rate-Exponent Region for a Class of Distributed Hypothesis Testing Against Conditional Independence Problems

We study a class of K-encoder hypothesis testing against conditional ind...

Random sections of ℓ_p-ellipsoids, optimal recovery and Gelfand numbers of diagonal operators

We study the circumradius of a random section of an ℓ_p-ellipsoid, 0<p≤∞...

From Small-World Networks to Comparison-Based Search

The problem of content search through comparisons has recently received ...