BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
DTSTART:20240310T030000
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:CDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:CST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP;TZID=America/Chicago:20260409T212501
UID:197274@calendar.wisc.edu
DTSTART;TZID=America/Chicago:20240718T140000
DTEND;TZID=America/Chicago:20240718T150000
DESCRIPTION:Testing the properties of unknown quantum states is fundamental
  to understanding quantum devices. For a general unknown state\, an expone
 ntial number of copies is needed. In the low-complexity region\, we establ
 ish the connection between the state's complexity and the sample complexit
 y of learning it. Furthermore\, we show that one can learn nontrivial info
 rmation from a single copy if the state has low complexity. We derive the 
 optimal learning strategy for quantum Markov states.\n\nCONTACT: 630-7052\
 , reps@cs.wisc.edu\n\nONLINE: https://uwmadison.zoom.us/j/99412082812?pwd=
 f2Oab1dGuhnBYa6rVOgtjwhP5s8vcv.1&amp\;from=addon
LOCATION:4310 Computer Sciences  (Also offered online)
SUMMARY:Nengkun Yu (Stony Brook): A Tale of Quantum State Complexity and Le
 arning Complexity
END:VEVENT
END:VCALENDAR