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:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dac6a5d9656
DTSTART;TZID=America/Toronto:20170306T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170306T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/colloquium-
 pravesh-kothari
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Colloquium: Pravesh Kothari
CLASS:PUBLIC
DESCRIPTION:QUANTUM ENTANGLEMENT\, SUM-OF-SQUARES AND THE LOG-RANK CONJECTU
 RE\n\nPRAVESH KOTHARI\, PRINCETON UNIVERSITY\n\nThis talk will be about a
  sub-exponential time algorithm for the Best\nSeparable State (BSS) proble
 m. For every constant \\eps>0\, we give an\nexp(\\sqrt(n) \\poly log(n))-t
 ime algorithm for the 1 vs 1-\\eps BSS\nproblem of distinguishing\, given 
 an n^2 x n^2 matrix M corresponding\nto a quantum measurement\, between th
 e case that there is a separable\n(i.e.\, non-entangled) state \\rho that 
 M accepts with probability 1\,\nand the case that every separable state is
  accepted with probability\nat most 1-\\eps.
DTSTAMP:20260411T220941Z
END:VEVENT
END:VCALENDAR