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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f57c5a106a1
DTSTART;TZID=America/Toronto:20250417T160000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250417T170000
URL:https://uwaterloo.ca/pure-mathematics/events/analysis-seminar-196
SUMMARY:Analysis Seminar
CLASS:PUBLIC
DESCRIPTION:KIERAN MASTEL\, UNIVERSITY OF WATERLOO\n\nThe weighted algebra 
 approach to constraint system games\n\nEntanglement allows for correlation
 s between spatially separated\nexperiments that are not possible classical
 ly. One way to study the\ncomputational power of entanglement is via nonlo
 cal games. I will\ndiscuss my recent works with Eric Culf and William Slof
 stra on\nconstraint system games. Different types of perfect entangled\nst
 rategies for these games can be understood as representations of the\nalge
 bra of the underlying constraint system. The weighted algebra\nformalism\,
  introduced by Slofstra and me\, extends this to non-perfect\nstrategies. 
 Using this formalism we can show that classical reductions\nbetween constr
 aint systems are sound against quantum provers\, which\nallows us to prove
  the RE-completeness of some constraint system games\nand to show that MIP
 * admits two prover perfect zero knowledge proofs.\n\nMC 5417
DTSTAMP:20260502T042354Z
END:VEVENT
END:VCALENDAR