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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69df669641961
DTSTART;TZID=America/Toronto:20220504T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220504T120000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-quantum-computing-generalized-adversary-method-for-quantum-query-complex
 ity
LOCATION:200 University Avenue West Online master’s thesis presentation W
 aterloo ON N2L 3G1 Canada
SUMMARY:Master’s Thesis Presentation • Quantum Computing • A Generali
 zed\nAdversary Method for Quantum Query Complexity
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS MASTER’S THESIS PRESENTATION WILL BE GIVEN 
 ONLINE.\n\nRORY SOIFFER\, MASTER’S CANDIDATE\n_David R. Cheriton School 
 of Computer Science_\n\nSUPERVISOR: Professor Shalev Ben-David\n\nQuantum 
 query complexity measures the minimum number of queries a\nquantum algorit
 hm needs to make to some input string to compute a\nfunction of that input
 . Query complexity models are widely used\nthroughout quantum computing\, 
 from setting limits on quantum\nalgorithms to analyzing post-quantum crypt
 ography.
DTSTAMP:20260415T102110Z
END:VEVENT
END:VCALENDAR