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:69e467fe4e01b
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
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1201 + ZOOM W
 aterloo ON N2L 3G1 Canada
SUMMARY:Generalized Rényi entropy accumulation theorem and generalized\nqu
 antum probability estimation
CLASS:PUBLIC
DESCRIPTION:CS/MATH SEMINAR - AMIR ARQAND\, IQC \n\nQuantum-Nano Centre\, 
 200 University Ave West\, Room QNC 1201 Waterloo\,\nON CA N2L 3G1 In perso
 n + ZOOM\n\nThe entropy accumulation theorem\, and its subsequent generali
 zed\nversion\, is a powerful tool in the security analysis of many\ndevice
 -dependent and device-independent cryptography protocols.\nHowever\, it ha
 s the drawback that the finite-size bounds it yields are\nnot necessarily 
 optimal\, and furthermore\, it relies on the\nconstruction of an affine mi
 n-tradeoff function\, which can often be\nchallenging to construct optimal
 ly in practice. In this talk\, we\naddress both of these challenges simult
 aneously by deriving a new\nentropy accumulation bound. Our bound yields s
 ignificantly better\nfinite-size performance\, and can be computed as an i
 ntuitively\ninterpretable convex optimization\, without any specification 
 of affine\nmin-tradeoff functions. Furthermore\, it can be applied directl
 y at the\nlevel of R´enyi entropies if desired\, yielding fully-R´enyi s
 ecurity\nproofs. Our proof techniques are based on elaborating on a connec
 tion\nbetween entropy accumulation and the frameworks of quantum probabili
 ty\nestimation or f-weighted R´enyi entropies\, and in the process we\nob
 tain some new results with respect to those frameworks as well.
DTSTAMP:20260419T052830Z
END:VEVENT
END:VCALENDAR