BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:CQIF Seminar
SUMMARY:Optimal probabilistic storage and retrieval of uni
 tary channels - Michal Sedlák\, Slovak Academy of 
 Sciences
DTSTART;TZID=Europe/London:20191010T141500
DTEND;TZID=Europe/London:20191010T151500
UID:TALK131218AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/131218
DESCRIPTION:We address the question of a quantum memory storag
 e of quantum dynamics. In particular\, we design a
 n optimal protocol for N→1 probabilistic storage-a
 nd-retrieval of unitary channels on d-dimensional 
 quantum systems. If we may access the unknown unit
 ary gate only N-times\, we show that the optimal s
 uccess probability of perfect retrieval of its sin
 gle use is N/(N−1+d^2). The derived size of the me
 mory system exponentially improves the known upper
  bound on the size of the program register needed 
 for probabilistic programmable quantum processors.
  Our results are closely related to probabilistic 
 perfect alignment of reference frames and probabil
 istic port-based teleportation.
LOCATION:MR15\, Centre for Mathematical Sciences\, Wilberfo
 rce Road\, Cambridge
CONTACT:Sergii Strelchuk
END:VEVENT
END:VCALENDAR