2006/10/16 by Gilad Gour · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Combinatorics #Computer science #Concurrence #Discrete mathematics #Isomorphism (crystallography) #LOCC #Mathematics #Multipartite #Multipartite entanglement #Philosophy #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Regular polygon #Simple (philosophy) #Squashed entanglement #State (computer science) #quant-ph
paper · pdf · doi:10.1103/physreva.74.052307
published as Physical Review A 74, 052307 (2006) · 6 pages, to appear in Phys. Rev. A
arxiv created 2006/10/16 · openalex publication_date 2006/11/06 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The entanglement of collaboration (EOC) quantifies the maximum amount of entanglement that can be generated between two parties, A and B, given collaboration with N\ensuremath-2 other parties, when the N parties share a multipartite (possibly mixed) state and where the collaboration consists of local operations and classical communication by all parties. The localizable entanglement (LE) is defined similarly except that A and B do not participate in the effort to generate bipartite entanglement. We compare between these two operational definitions and find sufficient conditions for which the EOC is equal to the LE. In particular, we find that the two are equal whenever they are measured by the concurrence or by one of its generalizations called the G-concurrence. We also find a simple expression for the LE in terms of the Jamiolkowski isomorphism and prove that it is convex.