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:20100314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20101107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e405f89a683
DTSTART;TZID=America/Toronto:20101109T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20101109T130000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/sevag-ghari
 bian-approximation-algorithms-qma-complete
LOCATION:RAC - Research Advancement Centre 475 Wes Graham Way 2009 Waterloo
  ON N2L 6R2 Canada
SUMMARY:Sevag Gharibian: Approximation algorithms for QMA-complete problems
CLASS:PUBLIC
DESCRIPTION:Approximation algorithms for classical constraint satisfaction\
 nproblems are one of the main research areas in theoretical computer\nscie
 nce. A natural generalization of constraint satisfaction problems\nto the 
 quantum setting is the local Hamiltonian problem\, which is of\nsignifican
 t interest to both complexity theorists and to physicists\nstudying proper
 ties of physical systems alike. In this talk\, we define\na natural approx
 imation version of the local Hamiltonian problem and\ninitiate its study. 
 We present two main results.
DTSTAMP:20260418T223016Z
END:VEVENT
END:VCALENDAR