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:69d625f50b4a9
DTSTART;TZID=America/Toronto:20220818T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220818T150000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/tight-bound
 s-quantum-learning-and-testing-without-quantum
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West QNC 1201 Wate
 rloo ON N2L 3G1 Canada
SUMMARY:Tight bounds for Quantum Learning and Testing without Quantum Memor
 y
CLASS:PUBLIC
DESCRIPTION:JERRY LI - MICROSOFT RESEARCH\n\nIn this talk\, we consider tw
 o fundamental tasks in quantum state\nestimation\, namely\, quantum tomogr
 aphy and quantum state\ncertification. In the former\, we are given n copi
 es of an unknown\nmixed state rho\, and the goal is to learn it to good ac
 curacy in trace\nnorm. In the latter\, the goal is to distinguish if rho i
 s equal to\nsome specified state\, or far from it. When we are allowed to 
 perform\narbitrary (possibly entangled) measurements on our copies\, then 
 the\nexact sample complexity of these problems is well-understood. However
 \,\narbitrary measurements are expensive\, especially in terms of quantum\
 nmemory\, and impossible to perform on near-term devices. In light of\nthi
 s\, a recent line of work has focused on understanding the\ncomplexity of 
 these problems when the learner is restricted to making\nincoherent (aka s
 ingle-copy) measurements\, which can be performed much\nmore efficiently\,
  and crucially\, capture the set of measurements that\ncan be be performed
  without quantum memory. However\, characterizing\nthe copy complexity of 
 such algorithms has proven to be a challenging\ntask\, and closing this ga
 p has been posed as an open question in\nvarious previous papers.
DTSTAMP:20260408T095501Z
END:VEVENT
END:VCALENDAR