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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0d13e281ca
DTSTART;TZID=America/Toronto:20240405T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240405T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-srijita-kundu
SUMMARY:Tutte Colloquium - Srijita Kundu
CLASS:PUBLIC
DESCRIPTION:TITLE: Oracle separation of QMA and QCMA with bounded adaptivit
 y\n\nSPEAKER:\n Srijita Kundu\n\nAFFILIATION:\n University of Waterloo\n\n
 LOCATION:\n MC 5501\n\nABSTRACT: It is a long-standing open problem in qua
 ntum complexity\ntheory whether the two possible quantum analogs of NP are
  equivalent.\nQMA is defined as the class of decision problems that are so
 lvable by\na polynomial-time quantum algorithm that has access to a\npolyn
 omial-sized quantum proof\, whereas QCMA is the class of decision\nproblem
 s that are solvable by a polynomial-time quantum algorithm that\nonly has 
 access to the polynomial-sized classical proof. In other\nwords\, the QMA 
 vs QCMA question asks: are quantum proofs more powerful\nthan classical pr
 oofs?
DTSTAMP:20260404T085214Z
END:VEVENT
END:VCALENDAR