BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Approximate entropy accumulation [Confirmed]
DTSTART:20250528T150000Z
DTEND:20250528T163000Z
DTSTAMP:20260608T074300Z
UID:indico-event-1260@events.perimeterinstitute.ca
DESCRIPTION:Speakers: Frédéric Dupuis (University of Montreal)\n\nThe en
 tropy accumulation theorem (EAT) allows us to lower\nbound the min-entropy
  of a state that can be generated by a chain of\nquantum channels satisfyi
 ng a Markov chain condition\, and can be used to\nprove the security of QK
 D protocols\, including device-independent ones.\nHowever\, one of its dra
 wbacks is that it only applies to states with a\nfairly rigid structure\; 
 in particular\, the Markov chain condition must\nbe satisfied exactly. Wha
 t happens when we relax this assumption by\nallowing the required structur
 e to be satisfies only approximately? Does\ndoing so lead to interesting a
 pplications? We answer both questions by\nthe affirmative: we present two 
 flavours of approximate EAT\, and show\nthat it can be used to prove the s
 ecurity of parallel device-independent\nQKD\, and to analyze QKD protocols
  under source correlations. Along the\nway\, we will introduce the concept
  of "approximation chain" which\nunderpins the new results.\n \nThis is j
 oint work with Ashutosh Marwah\; the talk will cover material\nfrom 2412.0
 6723\, 2402.12346\, and 2308.11736.\n\nhttps://events.perimeterinstitute.c
 a/event/1260/
LOCATION:PI/4-405 - Bob Room (Perimeter Institute for Theoretical Physics)
URL:https://events.perimeterinstitute.ca/event/1260/
END:VEVENT
END:VCALENDAR