2008/04/01 by Dong Pyo Chi, Dong Pyo, Jeong Woon Choi +4 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Concurrence #Epistemology #Mathematical economics #Mathematics #Multipartite #Philosophy #Physics #Property (philosophy) #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Qubit #State (computer science) #quant-ph
paper · pdf · doi:10.1063/1.3020685
published as J. Math. Phys. 49, 112102 (2008) · 4 pages, no figure
arxiv created 2008/04/01 · openalex publication_date 2008/11/01 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
There is an interesting property about multipartite entanglement, called the monogamy of entanglement. The property can be shown by the monogamy inequality, called the Coffman–Kundu–Wootters inequality [Phys. Rev. A 61, 052306 (2000); Coffman–Kundu–WoottersPhys. Rev. Lett. 96, 220503 (2006)], and more explicitly by the monogamy equality in terms of the concurrence and the concurrence of assistance, CA(BC)2=CAB2+(CACa)2, in the three-qubit system. In this paper, we consider the monogamy equality in 2⊗2⊗d quantum systems. We show that CA(BC)=CAB if and only if CACa=0 and also show that if CA(BC)=CACa, then CAB=0, while there exists a state in a 2⊗2⊗d system such that CAB=0 but CA(BC)>CACa.