2009/03/26 by Francesco Buscemi, Gilad Gour, Jeong San Kim
Computer Science · Mathematics · Physics and Astronomy · #Computer science #Dimension (graph theory) #Mathematics #Multipartite #Multipartite entanglement #Physics #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Squashed entanglement #quant-ph
paper · pdf · doi:10.1103/physreva.80.012324
published as Phys. Rev. A 80, 012324 (2009) · 9 pages, 1 figure, few typos corrected
arxiv created 2009/03/26 · openalex publication_date 2009/07/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
While quantum entanglement is known to be monogamous (i.e., shared entanglement is restricted in multipartite settings), here we show that distributed entanglement (or the potential for entanglement) is by nature polygamous. By establishing the concept of one-way unlocalizable entanglement (UE) and investigating its properties, we provide a polygamy inequality of distributed entanglement in tripartite quantum systems of arbitrary dimension. We also provide a polygamy inequality in multiqubit systems and several trade-offs between UE and other correlation measures.