We consider multipartite states of qubits and prove that their bipartite quantum entanglement, as quantified by the concurrence, satisfies a monogamy inequality conjectured by Coffman, Kundu, and Wootters. We relate this monogamy inequality to the concept of frustration of correlations in quantum spin systems.
We investigate possible generalizations of the Coffman-Kundu-Wootters monogamy inequality to four qubits, accounting for multipartite entanglement in addition to the bipartite terms. We show that the most natural extension of the inequality does not hold in general, and we describe the violations of this inequality in detail. We investigate alternative ways to extend the monogamy inequality to express a constraint on entanglement sharing valid for all four-qubit states, and perform an extensive numerical analysis of randomly generated four-qubit states to explore the properties of such extensions.
We provide a detailed proof of an analytical lower bound of entanglement quantified by concurrence for arbitrary bipartite quantum states. It is shown that though the bound does not allow one to detect bound entanglement, it is tight for some mixed states and can detect most of the free entanglement. On the other hand, it is known that the entanglement monogamy inequality proposed by Coffman, Kundu, and Wootters is, in general, not true for higher-dimensional quantum states. Inducing from the lower bound of concurrence, we find a proper form of entanglement monogamy inequality for arbitrary pure quantum states.
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.