2005/05/12 by Gilad Gour, David Meyer, David A. Meyer +1 · 5 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Computer science #Concurrence #Discrete mathematics #Mathematics #Monotone polygon #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Squashed entanglement #State (computer science) #W state #quant-ph
paper · pdf · doi:10.1103/physreva.72.042329
published as Phys. Rev. A 72, 042329 (2005) · 5 pages, no figures
arxiv created 2005/05/12 · openalex publication_date 2005/10/26 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Certain quantum-information tasks require entanglement of assistance, namely, a reduction of a tripartite entangled state to a bipartite entangled state via local measurements. We establish that concurrence of assistance (COA) identifies capabilities of and limitations to producing pure bipartite entangled states from pure tripartite entangled states and prove that COA is an entanglement monotone for (2\ifmmode×\else\texttimes\fi2\ifmmode×\else\texttimes\fin)-dimensional pure states. Moreover, if the COA for the pure tripartite state is at least as large as the concurrence of the desired pure bipartite state, then the former may be transformed to the latter via local operations and classical communication, and we calculate the maximum probability for this transformation when this condition is not met.