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:68294e28608d5
DTSTART;TZID=America/Toronto:20240110T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240110T130000
URL:/institute-for-quantum-computing/events/iqc-student
 -seminar-featuring-senrui-chen-university-chicago
SUMMARY:IQC Student Seminar Featuring Senrui Chen\, University of Chicago
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTIGHT BOUNDS FOR PAULI CHANNEL LEARNING WITH AND WI
 THOUT ENTANGLEMENT\n\nQuantum Nano Centre\, 200 University Ave West\, Room
  QNC 1201\nÀ¶Ý®ÊÓƵ\, ON CA N2L 3G1\n\nQuantum entanglement is a crucial r
 esource for learning properties\nfrom nature\, but a precise characterizat
 ion of its advantage can be\nchallenging. In this work\, we consider learn
 ing algorithms without\nentanglement as those that only utilize separable 
 states\,\nmeasurements\, and operations between the main system of interes
 t and\nan ancillary system. Interestingly\, these algorithms are equivalen
 t to\nthose that apply quantum circuits on the main system interleaved wit
 h\nmid-circuit measurements and classical feedforward. Within this\nsettin
 g\, we prove a tight lower bound for Pauli channel learning\nwithout entan
 glement that closes the gap between the best-known upper\nbound. In partic
 ular\, we show that Θ(n^2/_ε_^2) rounds of\nmeasurements are required to
  estimate each eigenvalue of an n-qubit\nPauli channel to _ε_ error wit
 h high probability when learning\nwithout entanglement. In contrast\, a le
 arning algorithm with\nentanglement only needs Θ(1/_ε_^2) copies of the 
 Pauli channel. Our\nresults strengthen the foundation for an entanglement-
 enabled\nadvantage for Pauli noise characterization. We will talk about\n
 ongoing experimental progress in this direction.\n\nREFERENCE: Mainly base
 d on [arXiv: 2309.13461]\n 
DTSTAMP:20250518T030408Z
END:VEVENT
END:VCALENDAR