Two computable sets of multipartite entanglement measures

Details Two computable sets of multipartite entanglement measures Two computable sets of multipartite entanglement measures

2009-03-29

arxiv.org/abs/0903.5092v1

Phys. Rev. A 79, 062308 (2009)

Physics

Quantum Physics

3 figures, 21 pages

Scientific paper

10.1103/PhysRevA.79.062308

We present two sets of computable entanglement measures for multipartite systems where each subsystem can have different degrees of freedom (so-called qudits). One set, called 'separability' measure, reveals which of the subsystems are separable/entangled. For that we have to extend the concept of k-separability for multipartite systems to a novel unambiguous separability concept which we call \gamma_k-separability. The second set of entanglement measures reveals the 'kind' of entanglement, i.e. if it is bipartite, tripartite, ..., n-partite entangled and is denoted as the 'physical' measure. We show how lower bounds on both sets of measures can be obtained by the observation that any entropy may be rewritten via operational expressions known as m-concurrences. Moreover, for different classes of bipartite or multipartite qudit systems we compute the bounds explicitly and discover that they are often tight or equivalent to positive partial transposition (PPT).

Affiliated with

Also associated with

No associations

Rating

Two computable sets of multipartite entanglement measures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two computable sets of multipartite entanglement measures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two computable sets of multipartite entanglement measures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-424267