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:20120311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20111106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d8347d7a2fe
DTSTART;TZID=America/Toronto:20120409T123000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20120409T130000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/aram-harrow
 -detecting-pure-entanglement-easy-so-detecting
LOCATION:RAC - Research Advancement Centre 475 Wes Graham Way 2009 Waterloo
  ON N2L 6R2 Canada
SUMMARY:Aram Harrow: Detecting pure entanglement is easy\, so detecting mix
 ed\nentanglement is hard
CLASS:PUBLIC
DESCRIPTION:Aram Harrow\, University of Washington \n\nABSTRACT\n\nThis tal
 k will begin by justifying the first part of the title\, by\nexplaining a 
 method to test whether a given multipartite pure state is\nproduct or far 
 from product\, given only two copies of the state. Next\,\nI'll explain ho
 w this test has implications for the computational\nhardness of a large nu
 mber of optimization problems.
DTSTAMP:20260409T232133Z
END:VEVENT
END:VCALENDAR