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

11/01/2021
by   Ke Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2023

On the optimal error exponents for classical and quantum antidistinguishability

The concept of antidistinguishability of quantum states has been studied...
research
07/18/2022

Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels

A fundamental quantity of interest in Shannon theory, classical or quant...
research
02/22/2022

Total insecurity of communication via strong converse for quantum privacy amplification

Quantum privacy amplification is a central task in quantum cryptography....
research
05/08/2019

Bounds on Lyapunov exponents

Lyapunov exponents describe the asymptotic behavior of the singular valu...
research
11/11/2021

Reliability Function of Quantum Information Decoupling

Quantum information decoupling is an important quantum information proce...
research
01/02/2018

Exact Soft-Covering Exponent

This work establishes the exact exponent for the soft-covering phenomeno...
research
09/29/2021

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≤∞...

Please sign up or login with your details

Forgot password? Click here to reset