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:Mixed state entanglement: bounds\, computation and
optimal ensembles - Peter Love (Haverford College
)
DTSTART;TZID=Europe/London:20131007T140000
DTEND;TZID=Europe/London:20131007T150000
UID:TALK46424AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/46424
DESCRIPTION:Quantifying entanglement has been a longstanding g
oal of quantum information theory\, and many measu
res for pure states exist. These measures may be e
xtended to mixed states by the convex roof constru
ction. This requires the determination of the conv
ex decomposition of the density matrix into pure s
tates that minimizes the average pure state entang
lement. One may regard this as the mean pure-state
entanglement cost of synthesizing the density mat
rix. This minimization is challenging\, and exact
solutions are only known in a few cases\, the most
famous of which is the concurrence for two qubits
. The next hardest case would seem to be the three
-tangle for mixed states of three qubits\, for whi
ch an analytic form is currently unknown. In this
talk I will describe numerical techniques to both
compute and bound the three-tangle\, and give some
properties of the minimal ensembles for this and
other polynomial entanglement monotones.
LOCATION:Seminar Room 1\, Isaac Newton Institute for Mathem
atical Sciences
CONTACT:William Matthews
END:VEVENT
END:VCALENDAR