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:69da83a01db71
DTSTART;TZID=America/Toronto:20161205T114500
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20161205T114500
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/theory-quan
 tum-information-and-computation-dave-touchette
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1201 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Theory of Quantum Information and Computation: Dave Touchette
CLASS:PUBLIC
DESCRIPTION:EXPONENTIAL SEPARATION BETWEEN QUANTUM COMMUNICATION COMPLEXITY
  AND\nCLASSICAL INFORMATION COMPLEXITY\n\nDAVE TOUCHETTE\, IQC\n\nWe exhib
 it a Boolean function for which the quantum communication\ncomplexity is e
 xponentially larger than the classical information\ncomplexity. An exponen
 tial separation in the other direction was\nalready known from the work of
  Kerenidis et. al. [SICOMP 44\, pp.\n1550--1572]\, hence our work implies 
 that these two complexity measures\nare incomparable. As classical informa
 tion complexity is an upper\nbound on quantum information complexity\, whi
 ch in turn is equal to\namortized quantum communication complexity\, our w
 ork implies that a\ntight direct sum result for distributional quantum com
 munication\ncomplexity cannot hold.
DTSTAMP:20260411T172344Z
END:VEVENT
END:VCALENDAR