BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:CQIF Seminar
SUMMARY:Flexible constrained de Finetti reductions and par
allel repetition of multi-player non-local games -
Cécilia Lancien\, University of Madrid
DTSTART;TZID=Europe/London:20161117T141500
DTEND;TZID=Europe/London:20161117T151500
UID:TALK67575AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/67575
DESCRIPTION:Roughly speaking\, de Finetti type theorems allow
to reduce the analysis of permutation-invariant sc
enarios to that of i.i.d. ones. In this talk\, I w
ill present certain variants of such de Finetti re
ductions\, and show how they can be used to study
the parallel repetition of multi-player non-local
games. More precisely\, the problem one usually wa
nts to solve in this context is the following: if
players sharing certain physical resources cannot
win one instance of a game with probability 1\, do
es their probability of winning n instances of thi
s game at the same time decays to 0 exponentially
fast? Perhaps surprisingly\, the answer to this qu
estion is not trivially "yes"\, even though I will
show that e.g. in the case of no-signalling corre
lations between the players\, it is indeed "yes" i
n almost full generality. If time allows\, I will
also discuss how such de Finetti reductions can be
used to study the (weakly) multiplicative behavio
r of other quantities showing up in quantum inform
ation theory.\nThis talk will be based on joint wo
rk with Andreas Winter\, either appearing in arXiv
[quant-‐ph]1506.07002 or arXiv[quant-‐ph]1605.09
013.\n
LOCATION:MR4\, Centre for Mathematical Sciences\, Wilberfor
ce Road\, Cambridge
CONTACT:Steve Brierley
END:VEVENT
END:VCALENDAR