Mixed State Entanglement of Assistance and the Generalized Concurrence
Abstract
We consider the maximum bipartite entanglement that can be distilled from a single copy of a multipartite mixed entangled state, where we focus mostly on d× d× n-dimensional tripartite mixed states. We show that this assisted entanglement, when measured in terms of the generalized concurrence (named G-concurrence) is (tightly) bounded by an entanglement monotone, which we call the G-concurrence of assistance. The G-concurrence is one of the possible generalizations of the concurrence to higher dimensions, and for pure bipartite states it measures the geometric mean of the Schmidt numbers. For a large (non-trivial) class of d× d-dimensional mixed states, we are able to generalize Wootters formula for the concurrence into lower and upper bounds on the G-concurrence. Moreover, we have found an explicit formula for the G-concurrence of assistance that generalizes the expression for the concurrence of assistance for a large class of d× d× n dimensional tripartite pure states.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.