BEGIN:VCALENDAR
PRODID:-//AddEvent Inc//AddEvent.com v1.7//EN
VERSION:2.0
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20261101T010000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:Tight bounds for Pauli channel learning with and without entanglement\n\nQuantum entanglement is a crucial resource for learning properties from nature\, but a precise characterization of its advantage can be challenging. In this work\, we consider learning algorithms without entanglement as those that only utilize separable states\, measurements\, and operations between the main system of interest and an ancillary system. Interestingly\, these algorithms are equivalent to those that apply quantum circuits on the main system interleaved with mid-circuit measurements and classical feedforward. Within this setting\, we prove a tight lower bound for Pauli channel learning without entanglement that closes the gap between the best-known upper bound. In particular\, we show that Θ(n^2/ε^2) rounds of measurements are required to estimate each eigenvalue of an n-qubit Pauli channel to ε error with high probability when learning without entanglement. In contrast\, a learning algorithm with entanglement only needs Θ(1/ε^2) copies of the Pauli channel. Our results strengthen the foundation for an entanglement-enabled advantage for Pauli noise characterization. We will talk about ongoing experimental progress in this direction.\n\nReference: Mainly based on [arXiv: 2309.13461]
X-ALT-DESC;FMTTYPE=text/html:<strong>Tight bounds for Pauli channel learning with and without entanglement</strong><br><br>Quantum entanglement is a crucial resource for learning properties from nature, but a precise characterization of its advantage can be challenging. In this work, we consider learning algorithms without entanglement as those that only utilize separable states, measurements, and operations between the main system of interest and an ancillary system. Interestingly, these algorithms are equivalent to those that apply quantum circuits on the main system interleaved with mid-circuit measurements and classical feedforward. Within this setting, we prove a tight lower bound for Pauli channel learning without entanglement that closes the gap between the best-known upper bound. In particular, we show that Θ(n^2/ε^2) rounds of measurements are required to estimate each eigenvalue of an n-qubit Pauli channel to ε error with high probability when learning without entanglement. In contrast, a learning algorithm with entanglement only needs Θ(1/ε^2) copies of the Pauli channel. Our results strengthen the foundation for an entanglement-enabled advantage for Pauli noise characterization. We will talk about ongoing experimental progress in this direction.<br><br>Reference: Mainly based on [arXiv: 2309.13461]
UID:1775403613addeventcom
SUMMARY:IQC Student Seminar Featuring Senrui Chen\, University of Chicago
DTSTART;TZID=America/New_York:20240110T120000
DTEND;TZID=America/New_York:20240110T130000
DTSTAMP:20260405T154013Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:QNC 1201
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
BEGIN:VALARM
TRIGGER:-PT30M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR