Papers
Topics
Authors
Recent
Search
2000 character limit reached

Geometric approach to entanglement quantification with polynomial measures

Published 20 Jun 2016 in quant-ph, math-ph, and math.MP | (1606.06184v2)

Abstract: We show that the quantification of entanglement of any rank-2 state with any polynomial entanglement measure can be recast as a geometric problem on the corresponding Bloch sphere. This approach provides novel insight into the properties of entanglement and allows us to relate different polynomial measures to each other, simplifying their quantification. In particular, unveiling and exploiting the geometric structure of the concurrence for two qubits, we show that the convex roof of any polynomial measure of entanglement can be quantified exactly for all rank-2 states of an arbitrary number of qubits which have only one or two unentangled states in their range. We give explicit examples by quantifying the three-tangle exactly for several representative classes of three-qubit states. We further show how our methods can be used to obtain analytical results for entanglement of more complex states if one can exploit symmetries in their geometric representation.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.