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:20130310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20131103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e4b223364ad
DTSTART;TZID=America/Toronto:20140213T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20140213T133000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/yao-applica
 tions-information-theory-direct-sum-and-direct
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Yao: Applications of Information Theory in Direct Sum and Direct\nP
 roduct Problems
CLASS:PUBLIC
DESCRIPTION:PENGHUI YAO (CENTRE FOR QUANTUM TECHNOLOGIES\, SINGAPORE)\n\nA 
 fundamental question in complexity theory is how much resource is\nneeded 
 to solve k independent instances of a problem compared to the\nresource re
 quired to solve one instance. Suppose solving one instance\nof\na problem 
 with probability of correctness p\, we require c units of\nsome\nresource 
 in a given model of computation. A direct sum theorem states\nthat in orde
 r to compute k independent instances of a problem\, it
DTSTAMP:20260419T104451Z
END:VEVENT
END:VCALENDAR