Hannover 2010 – wissenschaftliches Programm

Bereiche | Tage | Auswahl | Suche | Downloads | Hilfe

Q: Fachverband Quantenoptik und Photonik

Q 56: Quantum Information: Quantum Communication II

Q 56.6: Vortrag

Freitag, 12. März 2010, 11:45–12:00, A 310

Quantum key distribution with finite resources: Smooth Min entropy vs. Smooth Rényi entropy — •Markus Mertz, Silvestre Abruzzo, Sylvia Bratzik, Hermann Kampermann, and Dagmar Bruß — Institut für Theoretische Physik III, Düsseldorf, Germany

We consider different entropy measures that play an important role in the analysis of the security of QKD with finite resources. The smooth min entropy leads to an optimal bound for the length of a secure key. Another bound on the secure key length was derived by using Rényi entropies. Unfortunately, it is very hard or even impossible to calculate these entropies for realistic QKD scenarios. To estimate the security rate it becomes important to find computable bounds on these entropies. Here, we compare a lower bound for the smooth min entropy with a bound using Rényi entropies. We compare these entropies for the six-state protocol with symmetric attacks.