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:69da3bb143567
DTSTART;TZID=America/Toronto:20170302T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170302T120000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/seminar-pen
 ghui-yao
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1201 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Seminar: Penghui Yao
CLASS:PUBLIC
DESCRIPTION:EXPECTED COMMUNICATION COST OF DISTRIBUTED QUANTUM TASKS\n\nPEN
 GHUI YAO\, UNIVERSITY OF MARYLAND\, BALTIMORE\n\nData compression is a fu
 ndamental problem in quantum and classical\ninformation theory. A typical 
 version of the problem is that the\nsender Alice receives a classical or q
 uantum) state from some known\nensemble and needs to transmit it to the re
 ceiver Bob with average\nerror below some specified bound. We consider the
  case in which the\nmessage can have a variable length and goal is to mini
 mise its\nexpected length. For the classical case\, this problem has a wel
 l-known\nsolution given by the Huffman coding.
DTSTAMP:20260411T121649Z
END:VEVENT
END:VCALENDAR