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:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683108167937e
DTSTART;TZID=America/Toronto:20170302T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170302T120000
URL:/institute-for-quantum-computing/events/seminar-pen
 ghui-yao
SUMMARY:Seminar: Penghui Yao
CLASS:PUBLIC
DESCRIPTION:Summary \n\nEXPECTED COMMUNICATION COST OF DISTRIBUTED QUANTUM 
 TASKS\n\nPENGHUI YAO\, UNIVERSITY OF MARYLAND\, BALTIMORE\n\nData compres
 sion is a fundamental problem in quantum and classical\ninformation theory
 . A typical version of the problem is that the\nsender Alice receives a cl
 assical or quantum) state from some known\nensemble and needs to transmit 
 it to the receiver Bob with average\nerror below some specified bound. We 
 consider the case in which the\nmessage can have a variable length and goa
 l is to minimise its\nexpected length. For the classical case\, this probl
 em has a well-known\nsolution given by the Huffman coding.\n 
DTSTAMP:20250523T234318Z
END:VEVENT
END:VCALENDAR