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:Nonasymptotic bounds for quantum purity amplification\nJack Spilecki | UC Berkeley\nIn quantum purity amplification\, one is given n copies of a noisy quantum state ρ∈ℂd×d and asked to prepare k copies of its principal eigenstate |vd⟩. Several prior works have derived information-theoretically optimal algorithms for this problem\, but the bounds they prove are only shown in the asymptotic regime as the number of samples n tends to infinity. In this paper\, we establish the following nonasymptotic guarantee: if ρ's eigenvalues are sorted p1≤⋯≤pd and pd−1\nLocation\n\n• QNC 4104\n• Online on ZoomMeeting ID: 912 8146 6256 \nPasscode\n: 494237\n\n
X-ALT-DESC;FMTTYPE=text/html:Nonasymptotic bounds for quantum purity amplification<br />Jack Spilecki | UC Berkeley<br />In quantum purity amplification, one is given n copies of a noisy quantum state ρ∈ℂd×d and asked to prepare k copies of its principal eigenstate |vd⟩. Several prior works have derived information-theoretically optimal algorithms for this problem, but the bounds they prove are only shown in the asymptotic regime as the number of samples n tends to infinity. In this paper, we establish the following nonasymptotic guarantee: if ρ's eigenvalues are sorted p1≤⋯≤pd and pd−1<br />Location<br /><ul><li>QNC 4104</li><li>Online on Zoom<ul><li>Meeting ID: 912 8146 6256 <br />Passcode<br />: 494237</li></ul></li></ul>
UID:f499846fc037486fba8f0a74fd9a027faddeventcom
SUMMARY:IQC Math and CS seminar featuring Jack Spilecki
DTSTART;TZID=America/New_York:20260729T140000
DTEND;TZID=America/New_York:20260729T150000
DTSTAMP:20260625T135117Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:QNC 4104
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
BEGIN:VALARM
TRIGGER:-PT30M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR