Polygamy of entanglement in multipartite quantum systems

2009/04/20 by Jeong San Kim
Computer Science · Mathematics · Physics and Astronomy · #Bipartite graph #Concurrence #Discrete mathematics #Mathematics #Multipartite #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum discord #Quantum entanglement #Quantum mechanics #Squashed entanglement #Statistical physics #W state #quant-ph

paper · pdf · doi:10.1103/physreva.80.022302

published as Physical Review A 80 022302 (2009) · 4 pages

arxiv created 2009/04/20 · openalex publication_date 2009/08/04 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

We show that bipartite entanglement distribution (or entanglement of assistance) in multipartite quantum systems is by nature polygamous. We first provide an analytical upper bound for the concurrence of assistance in bipartite quantum systems and derive a polygamy inequality of multipartite entanglement in arbitrary-dimensional quantum systems.

Citations

• Three qubits can be entangled in two inequivalent ways
• Concurrence vectors in arbitrary multipartite quantum systems
• Generalized W-class state and its monogamy relation
• Entanglement of Formation of an Arbitrary State of Two Qubits
• General Monogamy Inequality for Bipartite Qubit Entanglement
• Deterministic entanglement of assistance and monogamy constraints
• Distributed Entanglement