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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e58f6975020
DTSTART;TZID=America/Toronto:20220811T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220811T150000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/uncertainty
 -relations-graph-theory-0
SUMMARY:Uncertainty Relations from Graph Theory
CLASS:PUBLIC
DESCRIPTION:Quantum measurements are inherently probabilistic. Further defy
 ing our\nclassical intuition\, quantum theory often forbids us to precisel
 y\ndetermine the outcomes of simultaneous measurements. This phenomenon\ni
 s captured and quantified through uncertainty relations. Although\nstudied
  since the inception of quantum theory\, this problem of\ndetermining the 
 possible expectation values of a collection of quantum\nmeasurements remai
 ns\, in general\, unsolved. In this talk\, we will go\nover some basic no
 tions of graph theory that will allow us to derive\nuncertainty relations 
 valid for any set of dichotomic quantum\nobservables. We will then specify
  the many cases for which these\nrelations are tight\, depending on proper
 ties of some graphs\, and\ndiscuss a conjecture for the untight cases. Fin
 ally\, we will show some\ndirect applications to several problems in quant
 um information\,\nnamely\, in constructing entropic uncertainty relations\
 , separability\ncriteria and entanglement witnesses.
DTSTAMP:20260420T022857Z
END:VEVENT
END:VCALENDAR