CQuIC Seminars
Mixed state entanglement: bounds, computation and optimal ensembles
Presented by Peter Love, Haverford College
Quantifying entanglement has been a longstanding goal of quantum information theory, and many measures for pure states exist. These measures may be extended to mixed states by the convex roof construction. This requires the determination of the convex decomposition of the density matrix into pure states that minimizes the average pure state entanglement. One may regard this as the mean pure-state entanglement cost of synthesizing the density matrix. 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 which 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.
3:30 pm, Thursday, September 26, 2013
PAIS-2540, PAIS
Individuals with disabilities who need an auxiliary aid or service to attend or participate in P&A events should contact the Physics Department (phone: 505-277-2616, email: physics@unm.edu) well in advance to ensure your needs are accomodated. Event handouts can be provided in alternative accessible formats upon request. Please contact the Physics front office if you need written information in an alternative format.
A schedule of talks within the Department of Physics and Astronomy is available on the P&A web site at http://physics.unm.edu/pandaweb/events/index.php