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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dea792cce38
DTSTART;TZID=America/Toronto:20211213T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20211213T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/unique-game
 s-hardness-quantum-max-cut-and-vector-valued
SUMMARY:Unique Games hardness of Quantum Max-Cut\, and a vector-valued Bore
 ll's\ninequality
CLASS:PUBLIC
DESCRIPTION:JOHN WRIGHT\, UNIVERSITY OF TEXAS AT AUSTIN\n\nThe local Hamilt
 onian problem is one of the most fundamental problems\nin quantum computin
 g. It is a natural generalization of classical\nconstraint satisfaction p
 roblems to the quantum regime\, and it is the\ncanonical QMA-complete prob
 lem. In addition\, it arises naturally in\nthe study of many-body physics.
  Given an instance of the local\nHamiltonian problem\, the object is to fi
 nd its ground state or the\nenergy of this state.
DTSTAMP:20260414T204610Z
END:VEVENT
END:VCALENDAR