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:20140309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20131103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d76fa9088cc
DTSTART;TZID=America/Toronto:20140609T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20140609T153000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/mancinska-u
 nbounded-entanglement-can-be-needed-achieve
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1506 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Mancinska: Unbounded entanglement can be needed to achieve the opti
 mal\nsuccess probability
CLASS:PUBLIC
DESCRIPTION:LAURA MANCINSKA\, CENTRE FOR QUANTUM TECHNOLOGIES\, SINGAPORE\n
 \nQuantum entanglement is known to provide a strong advantage in many\ntwo
 -party distributed tasks. We investigate the question of how much\nentangl
 ement is needed to reach optimal performance. For the first\ntime we show 
 that there exists a purely classical scenario for which\nno finite amount 
 of entanglement suffices. To this end we introduce a\nsimple two-party non
 local game $H$\, inspired by Hardy's paradox. In\nour game each player has
  only two possible questions and can provide\nbit strings of any finite le
 ngth as answer.
DTSTAMP:20260409T092145Z
END:VEVENT
END:VCALENDAR