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:Secure decoupling of quantum systems: how to shred
quantum information - Francesco Buscemi (CQC Camb
ridge)
DTSTART;TZID=Europe/London:20081204T140000
DTEND;TZID=Europe/London:20081204T150000
UID:TALK15469AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/15469
DESCRIPTION:We consider the problem of decoupling a given bipa
rtite state under various constraints which make t
he decoupling task highly non-trivial. Among these
\, stand as notable examples the Landauer-like app
roach (where one minimises the amount of "work" ne
cessary for decoupling) and the geometrical approa
ch (where contraints are given as covariance prope
rties of the decoupling map). Correspondingly\, on
e obtains quantitative measures for the strength o
r amount of correlations present in the input stat
e.\n\n\nIn this talk\, I propose and study a model
of decoupling where the constraint can be underst
ood as a sort of security requirement: the amount
of correlations that can be transferred into the e
nvironment during the decoupling process has to be
upper-bounded by some security/leakage parameter.
As a consequence\, it turns out that\, in general
\, total correlations can be only partially erased
. Bounds for the one-shot case\, as well as some r
esults for the i.i.d. asymptotic limit are given.\
n
LOCATION:MR11\, Centre for Mathematical Sciences
CONTACT:Lawrence Ioannou
END:VEVENT
END:VCALENDAR