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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e883b722e35
DTSTART;TZID=America/Toronto:20231214T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231214T110000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/testing-qua
 ntum-satisfiability
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1501 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Testing quantum satisfiability
CLASS:PUBLIC
DESCRIPTION:CS/MATH SEMINAR - DOMINIC VERDON (UNIVERSITY OF BRISTOL)\n\nUni
 versity of Waterloo\, 200 University Ave West\, Waterloo ON QNC 1501\n+ ZO
 OM\n\nThe quantum Boolean satisfiability problem\, quantum k-SAT for short
 \,\nis the quantum analogue of the classical Boolean satisfiability\nprobl
 em. It is QMA_1-complete for k >2\, and therefore appears very\ndifficult 
 to solve in general. In this talk I will discuss a property\ntesting appro
 ach to quantum k-SAT which\, given the promise that an\ninstance of the pr
 oblem is either (i) satisfiable or (ii) far from\nsatisfiable by a product
  state\, yields a polynomial-time algorithm for\ndeciding which of the two
  mutually exclusive properties (i) or (ii)\nholds. To show this we apply s
 ome tools from combinatorics\,\nentanglement theory and algebraic geometry
 . The talk is based on joint\nwork with Ashley Montanaro and Changpeng Sha
 o\n(https://arxiv.org/abs/2301.10699).
DTSTAMP:20260422T081551Z
END:VEVENT
END:VCALENDAR