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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d758636c19e
DTSTART;TZID=America/Toronto:20230524T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230524T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/tale-commun
 ication-entanglement-and-graphs
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West QNC B204 Wate
 rloo ON N2L 3G1 Canada
SUMMARY:A tale of communication\, entanglement and graphs
CLASS:PUBLIC
DESCRIPTION:MATH/CS SEMINAR - FEATURING OLIVIER LALONDE UNIVERSITÉ DE MONT
 RÉAL\n\nQuantum communication complexity\, which concerns itself with\nde
 termining how much communication is required by two participants\nhaving a
 ccess to quantum resources to compute a boolean function of\ntheir inputs\
 , has long been a lively subfield of quantum information\nscience. The top
 ic of this talk will be the power of shared prior\nentanglement relative t
 o quantum communication without prior\nentanglement\, which\, despite havi
 ng been studied for more twenty\nyears\, remains rather mysterious. After 
 a quick review of the bare\nbones of classical communication complexity\, 
 I will proceed to discuss\nthe model of entanglement-assisted communicatio
 n complexity. 
DTSTAMP:20260409T074227Z
END:VEVENT
END:VCALENDAR