BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Mixed state entanglement: bounds\, computation and optimal ensembl
 es - Peter Love (Haverford College)
DTSTART:20131007T130000Z
DTEND:20131007T140000Z
UID:TALK46424@talks.cam.ac.uk
CONTACT:William Matthews
DESCRIPTION:Quantifying entanglement has been a longstanding goal of quant
 um information theory\, and many measures for pure states exist. These mea
 sures may be extended to mixed states by the convex roof construction. Thi
 s requires the determination of the convex decomposition of the density ma
 trix into pure states that minimizes the average pure state entanglement. 
 One may regard this as the mean pure-state entanglement cost of synthesizi
 ng the density matrix. This minimization is challenging\, and exact soluti
 ons are only known in a few cases\, the most famous of which is the concur
 rence for two qubits. The next hardest case would seem to be the three-tan
 gle for mixed states of three qubits\, for which an analytic form is curre
 ntly unknown. In this talk I will describe numerical techniques to both co
 mpute 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 Mathematical Sciences
END:VEVENT
END:VCALENDAR