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:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f88f2090fd2
DTSTART;TZID=America/Toronto:20180122T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180122T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quantum-ann
 ealing-vs-classical-optimization
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Quantum annealing vs classical optimization
CLASS:PUBLIC
DESCRIPTION:ELIZABETH CROSSON\, CALIFORNIA INSTITUTE OF TECHNOLOGY\n\nThe 
 equilibrium states of Hamiltonians without a sign problem can in\nmany cas
 es be efficiently sampled using classical Markov chain Monte\nCarlo method
 s. These simulation algorithms present a challenge to the\npossibility of 
 obtaining quantum speedups using transverse-field\nquantum annealing\, and
  in this talk I'll describe rigorous results on\nthe convergence of simula
 ted quantum annealing to a class of problems\nthat take exponential time t
 o solve by local search.
DTSTAMP:20260504T122048Z
END:VEVENT
END:VCALENDAR