BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2015/newsitem/6916/4-J
 une-4-2015-Theoretical-Computer-Science-Seminar-He
 nry-Yuen-MIT-
DTSTAMP:20150531T000000
SUMMARY:4 June 4 2015, Theoretical Computer Scienc
 e Seminar, Henry Yuen (MIT)
ATTENDEE;ROLE=Speaker:Henry Yuen (MIT)
DTSTART;TZID=Europe/Amsterdam:20150604T160000
DTEND;TZID=Europe/Amsterdam:20150604T170000
LOCATION:CWI room L017, Science Park 123, Amsterda
 m
DESCRIPTION:The Parallel Repetition Theorem is an 
 important tool in complexity theory and cryptograp
 hy, used to amplify the hardness of multiplayer ga
 mes. It roughly states that if a game G, involving
  two non-communicating players, has value p, then 
 the two-player game G^n -- n independent instances
  of G in parallel -- has value f(p,G)^n, where f(p
 ,G) is some (complicated) function of p and the ga
 me. Recently, there has been much interest in prov
 ing a quantum analogue of the Parallel Repetition 
 Theorem, where the players are allowed to use quan
 tum entanglement as part of their strategy. We giv
 e improved parallel repetition theorems for entang
 led games in the case that the players' inputs are
  uncorrelated.  For more information, contact Rona
 ld de Wolf (rdewolf at cwi.nl)
X-ALT-DESC;FMTTYPE=text/html:\n        <p>The Para
 llel Repetition Theorem is an important tool in co
 mplexity theory and cryptography, used to amplify 
 the hardness of multiplayer games. It roughly stat
 es that if a game G, involving two non-communicati
 ng players, has value p, then the two-player game 
 G^n -- n independent instances of G in parallel --
  has value f(p,G)^n, where f(p,G) is some (complic
 ated) function of p and the game. Recently, there 
 has been much interest in proving a quantum analog
 ue of the Parallel Repetition Theorem, where the p
 layers are allowed to use quantum entanglement as 
 part of their strategy.  We give improved parallel
  repetition theorems for entangled games in the ca
 se that the players' inputs are uncorrelated.</p>\
 n    \n        <p>For more information, contact Ro
 nald de Wolf (<a class="email">rdewolf <span class
 ="at">at</span> cwi.nl</a>)</p>\n    
URL:/NewsandEvents/Archives/2015/newsitem/6916/4-J
 une-4-2015-Theoretical-Computer-Science-Seminar-He
 nry-Yuen-MIT-
END:VEVENT
END:VCALENDAR