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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d1fe9d400cc
DTSTART;TZID=America/Toronto:20250718T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250718T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-ashwin-nayak-1
SUMMARY:Tutte colloquium-Ashwin Nayak
CLASS:PUBLIC
DESCRIPTION:TITLE:Learning quantum states\n\nSPEAKER:\n Ashwin Nayak\n\nAFF
 ILIATION:\n University of Waterloo\n\nLOCATION:\n MC 5501\n\nABSTRACT: Su
 ppose we are given a sequence of quantum registers\ninitialized to the sa
 me quantum state rho\, and would like to learn\nthe state rho. That is\, 
 we would like to design an algorithm that\nproduces a classical descripti
 on of an approximation to the state.\nHow many copies of rho dowe need to 
 be able to produce a suitable\napproximation? This talk will be a gentle 
 introduction to the problem\nand related results.\n\n 
DTSTAMP:20260405T061805Z
END:VEVENT
END:VCALENDAR