BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Flexible constrained de Finetti reductions and parallel repetition
  of multi-player non-local games - Cécilia Lancien\, University of Madrid
DTSTART:20161117T141500Z
DTEND:20161117T151500Z
UID:TALK67575@talks.cam.ac.uk
CONTACT:Steve Brierley
DESCRIPTION:Roughly speaking\, de Finetti type theorems allow to reduce th
 e analysis of permutation-invariant scenarios to that of i.i.d. ones. In t
 his talk\, I will present certain variants of such de Finetti reductions\,
  and show how they can be used to study the parallel repetition of multi-p
 layer non-local games. More precisely\, the problem one usually wants to s
 olve in this context is the following: if players sharing certain physical
  resources cannot win one instance of a game with probability 1\, does the
 ir probability of winning n instances of this game at the same time decays
  to 0 exponentially fast? Perhaps surprisingly\, the answer to this questi
 on is not trivially "yes"\, even though I will show that e.g. in the case 
 of no-signalling correlations between the players\, it is indeed "yes" in 
 almost full generality. If time allows\, I will also discuss how such de F
 inetti reductions can be used to study the (weakly) multiplicative behavio
 r of other quantities showing up in quantum information theory.\nThis talk
  will be based on joint work with Andreas Winter\, either appearing in arX
 iv[quant-­‐ph]1506.07002 or arXiv[quant-­‐ph]1605.09013.\n
LOCATION:MR4\, Centre for Mathematical Sciences\, Wilberforce Road\, Cambr
 idge
END:VEVENT
END:VCALENDAR