BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:669850e8ac2c4
DTSTART;TZID=America/Toronto:20240528T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240528T160000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/generalized
-renyi-entropy-accumulation-theorem-and
SUMMARY:Generalized Rényi entropy accumulation theorem and generalized\nqu
antum probability estimation
CLASS:PUBLIC
DESCRIPTION:Summary \n\nCS/MATH SEMINAR - AMIR ARQAND\, IQC \n\nQuantum-Na
no Centre\, 200 University Ave West\, Room QNC 1201 Waterloo\,\nON CA N2L
3G1 In person + ZOOM\n\nThe entropy accumulation theorem\, and its subsequ
ent generalized\nversion\, is a powerful tool in the security analysis of
many\ndevice-dependent and device-independent cryptography protocols.\nHow
ever\, it has the drawback that the finite-size bounds it yields are\nnot
necessarily optimal\, and furthermore\, it relies on the\nconstruction of
an affine min-tradeoff function\, which can often be\nchallenging to const
ruct optimally in practice. In this talk\, we\naddress both of these chall
enges simultaneously by deriving a new\nentropy accumulation bound. Our bo
und yields significantly better\nfinite-size performance\, and can be comp
uted as an intuitively\ninterpretable convex optimization\, without any sp
ecification of affine\nmin-tradeoff functions. Furthermore\, it can be app
lied directly at the\nlevel of R´enyi entropies if desired\, yielding ful
ly-R´enyi security\nproofs. Our proof techniques are based on elaborating
on a connection\nbetween entropy accumulation and the frameworks of quant
um probability\nestimation or f-weighted R´enyi entropies\, and in the pr
ocess we\nobtain some new results with respect to those frameworks as well
.\n
DTSTAMP:20240717T231656Z
END:VEVENT
END:VCALENDAR