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:Highly Entangled States With Almost No Secrecy - M
atthias Christandl\, LMU Munich
DTSTART;TZID=Europe/London:20091022T140000
DTEND;TZID=Europe/London:20091022T150000
UID:TALK21112AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/21112
DESCRIPTION:In this talk\, we will illuminate the relation bet
ween entanglement and secrecy by providing the fir
st example of a quantum state that is highly entan
gled\, but from which\, nevertheless\, almost no s
ecrecy can be extracted. More precisely\, we provi
de two bounds on the bipartite entanglement of the
totally antisymmetric state in dimension d. First
\, we show that the amount of secrecy that can be
extracted from the state is low\, to be precise it
is bounded by O(1/d). Second\, we show that the s
tate is highly entangled in the sense that we need
a large amount of singlets to create the state: e
ntanglement cost is larger than a constant\, indep
endent of d.\nIn order to obtain our results we us
e representation theory (plethysms!!!)\, linear pr
ogramming and the entanglement measure known as sq
uashed entanglement. This is joint work with Andre
as Winter and Norbert Schuch.\n
LOCATION:MR15\, Centre for Mathematical Sciences
CONTACT:Dr Alastair Kay
END:VEVENT
END:VCALENDAR