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:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ecefb12fb9a
DTSTART;TZID=America/Toronto:20221117T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221117T150000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/improved-ap
 proximation-algorithm-quantum-max-cut
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West hosted on ZOO
 M with group watch in QNC 3206 Waterloo ON N2L 3G1 Canada
SUMMARY:Improved Approximation Algorithm for Quantum Max-Cut
CLASS:PUBLIC
DESCRIPTION:IQC STUDENT SEMINAR FEATURING - ROBBIE KING\, CALTECH - ZOOM\n\
 nIt is impossible to solve the local Hamiltonian problem exactly\,\nassumi
 ng P is not equal to QMA. Instead\, one can ask for approximation\nalgorit
 hms\, which output states achieving good energy uniformly across\nall inst
 ances. Semi-definite programming (SDP) has achieved great\nsuccess in appr
 oximation algorithms for classical constraint\nsatisfaction. But how can w
 e round the SDP to an entangled quantum\nstate? Variational quantum algori
 thms can capture entangled quantum\nstates. ...
DTSTAMP:20260425T164537Z
END:VEVENT
END:VCALENDAR