Abstract
We establish a characterization of multi-qubit entanglement constraints in terms of non-negative power of entanglement measures based on unified-(q, s) entropy. Using the Hamming weight of the binary vector related with the distribution of subsystems, we establish a class of tight monogamy inequalities of multi-qubit entanglement based on the αth-power of unified-(q, s) entanglement for α ≥ 1. For 0 ≤ β ≤ 1, we establish a class of tight polygamy inequalities of multi-qubit entanglement in terms of the βth-power of unified-(q, s) entanglement of assistance. Thus our results characterize the monogamy and polygamy of multi-qubit entanglement for the full range of non-negative power of unified entanglement.
Similar content being viewed by others
Introduction
Quantum entanglement is a quintessential feature of quantum mechanics revealing the fundamental insights into the nature of quantum correlations. One distinct property of quantum entanglement without any classical counterpart is its limited shareability in multi-party quantum systems, known as the monogamy of entanglement (MoE)1,2. MoE is the fundamental ingredient in many quantum information processing tasks such as quantum cryptography3,4, and even in condensed-matter physics such as the N-representability problem for fermions5.
Mathematically, MoE is characterized in forms of an inequality, namely monogamy inequality. The first monogamy inequality was established in three-qubit systems by Coffman-Kundu-Wootters (CKW) as
for a three-qubit quantum state ρABC with its two-qubit reduced density matrices ρAB = trCρABC and ρAC = trBρABC, where τ(ρA|BC) is the bipartite entanglement between subsystems A and BC, quantified by tangle and τ(ρA|B) and τ(ρA|C) are the tangle between A and B and between A and C, respectively6. The tangle of a bipartite pure state \(|{\psi }_{AB}\rangle \) is defined as \(\tau ({|\psi \rangle }_{A|B})=2(1-{\rm{tr}}{\rho }_{A}^{2})\) where \({\rho }_{A}={{\rm{tr}}}_{B}{|\psi \rangle }_{AB}\langle \psi |\) is the reduced density matrix of \({|\psi \rangle }_{AB}\) onto the subsystem A. For a bipartite mixed state ρAB, its tangle is defined as \(\tau ({\rho }_{A|B})=\,{\rm{\min }}\,{\sum }_{i}\,{p}_{i}\tau ({|{\psi }_{i}\rangle }_{A|B})\) where the minimum is taken over all possible pure-state decompositions of \({\rho }_{AB}={\sum }_{i}\,{p}_{i}{|{\psi }_{i}\rangle }_{AB}\langle {\psi }_{i}|\)6. Later, three-qubit CKW inequality was generalized for arbitrary multi-qubit systems7 and some cases of multi-party, higher-dimensional quantum systems more than qubits in terms of various bipartite entanglement measures8,9,10,11.
Using the assisted entanglement that is a dual amount to bipartite entanglement measures, a dually monogamous (thus polygamous) property of multi-party entanglement was also established; for a three-qubit state ρABC, a polygamy inequality was proposed as
where \({\tau }^{a}({\rho }_{A|B})=\,{\rm{\max }}\,{\sum }_{i}\,{p}_{i}\tau ({|{\psi }_{i}\rangle }_{A|B})\) is the tangle of assistance whose maximum is taken over all possible pure-state decompositions of \({\rho }_{AB}={\sum }_{i}\,{p}_{i}{|{\psi }_{i}\rangle }_{AB}\langle {\psi }_{i}|\)12,13. Later, this tangle-based polygamy inequality of entanglement was generalized into multi-qubit systems as well as some class of higher-dimensional quantum systems using various entropic entanglement measures10,14,15. General polygamy inequalities of entanglement were also established in arbitrary dimensional multi-party quantum systems16,17.
Entanglement is an intrinsic nature of quantum states in composite systems that cannot be realized by local operations and classical communications (LOCC). Thus it is natural to classify entangled states by means of their interconvertibility under LOCC with non-zero probability, that is, stochastic LOCC (SLOCC). Unlike bipartite entanglement, multi-party quantum entanglement is known to have several inequivalent classes by means of SLOCC interconvertibility18. For example, it is known that genuine three-qubit pure entanglement has two inequivalent classes, Greenberger-Horne-Zeilinger (GHZ) class19 and W class18.
Although GHZ and W classes are both considered as the genuine three-qubit entanglement, these inequivalent classes reveal different characters; W-class states assume the maximum expected amount of two-qubit entanglement when one qubit is traced out, while GHZ-class states loose most two-qubit entanglement. This different characteristics can also be investigated in terms of entanglement monogamy and polygamy, as CKW and its dual inequalities for three-qubit systems are saturated by the W-class states, while each inequality can assume the largest differences between both sides for the GHZ-class states.
The saturation of CKW and its dual inequalities for the W-class states can be physically interpreted as a complete characterization genuine three-qubit (multi-party) entanglement in terms of two-qubit (bipartite) ones within it, whereas GHZ class has too fragile two-qubit ones to have such interpretation. Thus, not only a distinct phenomena in multi-party quantum systems, entanglement monogamy and polygamy can be used as an efficient tool to characterize multi-party quantum entanglement among different classes. However, three-qubit CKW inequality based on tangle is no more valid in higher-dimensional systems due to the existence of counterexamples in \(3\otimes 3\otimes 3\) and even in \(3\otimes 2\otimes 2\) quantum systems8,20. Thus it is an important task to have proper bipartite entanglement quantifications, besides tangle, showing tight monogamy and polygamy inequalities for efficient characterization of multi-party entanglements from different classes in multi-party and even in high-dimensional quantum systems.
Recently, a new class of monogamy inequalities using the αth-power of entanglement measures were proposed; for \(\alpha \ge \sqrt{2}\), the αth-power of entanglement of formation was shown to be used to establish a class of monogamy inequality of multi-qubit entanglement21, and a similar result was proposed using the αth-power of concurrence for α ≥ 221. Later, tighter monogamy and polygamy inequalities of entanglement using non-negative power of concurrence and square of convex-roof extended negativity were also proposed for multi-qubit systems22,23.
Here, we provide a full characterization of multi-qubit entanglement monogamy and polygamy constraints in terms of non-negative power of entanglement measures based on unified entropy24,25. Using the Hamming weight of the binary vector related with the distribution of subsystems, we establish a class of monogamy inequalities of multi-qubit entanglement based on the αth-power of unified-(q, s) entanglement11 for α ≥ 1. For 0 ≤ β ≤ 1, we establish a class of polygamy inequalities of multi-qubit entanglement in terms of the βth-power of unified-(q, s) entanglement of assistance15. Our results of monogamy and polygamy inequalities established here hold in a tighter way than other multi-qubit entanglement inequalities provided so far. Moreover, our new class of monogamy inequalities are also valid for the counterexamples of CKW monogamy inequality in higher-dimensional systems more than qubits.
This paper is organized as follows: First, we review the definitions of unified entropy, unified-(q, s) entanglement and unified-(q, s) entanglement of assistance as well as multi-qubit monogamy and polygamy inequalities in terms of unified entanglements. After providing notations and definitions about binary vectors and Hamming weight, we establish a class of tight monogamy inequalities in multi-qubit system based on the αth-power of unified-(q, s) entanglement for α ≥ 1. We further establish a class of tight polygamy inequalities of multi-qubit entanglement in terms of the βth-power of unified-(q, s) entanglement of assistance for 0 ≤ β ≤ 1. Finally, we summarize our results.
Results
Unified entropy and multi-qubit entanglement constraints
For q, s ≥ 0 with q ≠ 1 and s ≠ 0, unified-(q, s) entropy of a quantum state ρ is defined as24,25,
Although unified-(q, s) entropy has a singularity at s = 0, it converges to Rényi-q entropy as s tends to 026,27. We also note that unified-(q, s) entropy converges to Tsallis-q entropy28 when s tends to 1, and for any nonnegative s, unified-(q, s) entropy converges to von Neumann entropy as q tends to 1,
Using unified-(q, s) entropy in Eq. (1), a two-parameter class of bipartite entanglement measures was introduced; for a bipartite pure state \({|\psi \rangle }_{AB}\), its unified-(q, s) entanglement (UE)11 is
for each q, s ≥ 0 where \({\rho }_{A}={{\rm{tr}}}_{B}{|\psi \rangle }_{AB}\langle \psi |\) is the reduced density matrix of \({|\psi \rangle }_{AB}\) onto subsystem A. For a bipartite mixed state ρAB, its UE is
where the minimum is taken over all possible pure state decompositions of \({\rho }_{AB}={\sum }_{i}\,{p}_{i}{|{\psi }_{i}\rangle }_{AB}\langle {\psi }_{i}|\). As a dual concept to UE, unified-(q, s) entanglement of assistance (UEoA) was also introduced as
for q, s ≥ 0 where the maximum is taken over all possible pure state decompositions of ρAB15.
Due to the continuity of UE in Eq. (4) with respect to the parameters q and s, UE reduces to Rényi-q entanglement (RE)9 as s tends to 0, and it also reduces to Tsallis-q entanglement (TE)10 as s tends to 1. For any nonnegative s, UE converges to entanglement of formation (EoF) as q tends to 1,
therefore UE is one of the most general classes of bipartite entanglement measures including the classes of Rényi and Tsallis entanglements and EoF as special cases11. Similarly, the continuity of UEoA in Eq. (5) with respect to the parameters q and s assures that UEoA reduces to Rényi-q entanglement of assistance (REoA)9 and Tsallis-q entanglement of assistance (TEoA)10 when s tends to 0 or 1 respectively. For any nonnegative s, UEoA reduces to entanglement of assistance (EoA)
when q tends to 115.
Using UE as the bipartite entanglement measure, a two-parameter class of monogamy inequalities of multi-qubit entanglement was established11; for q ≥ 2, 0 ≤ s ≤ 1 and qs ≤ 3, we have
for any multi-qubit state \({\rho }_{{A}_{1}\cdots {A}_{N}}\) where \({E}_{q,s}({\rho }_{{A}_{1}|{A}_{2}\cdots {A}_{N}})\) is the UE of \({\rho }_{{A}_{1}{A}_{2}\cdots {A}_{N}}\) with respect to the bipartition between A1 and A2 \(\cdots \) AN, and \({E}_{q,s}({\rho }_{{A}_{1}|{A}_{i}})\) is the unified-(q, s) entanglement of the reduced density matrix \({\rho }_{{A}_{1}{A}_{i}}\) for each i = 2, …, N.
Later, it was shown that unified entropy can also be used to establish a class of polygamy inequalities of multi-qubit entanglement15; for 1 ≤ q ≤ 2 and −q2 + 4q − 3 ≤ s ≤ 1, we have
for any multi-qubit state \({\rho }_{{A}_{1}\cdots {A}_{N}}\) where \({E}_{q,s}^{a}({\rho }_{{A}_{1}|{A}_{2}\cdots {A}_{N}})\) is the UEoA of \({\rho }_{{A}_{1}{A}_{2}\cdots {A}_{N}}\) with respect to the bipartition between A1 and A2 \(\cdots \) AN, and \({E}_{q,s}^{a}({\rho }_{{A}_{1}|{A}_{i}})\) is the UEoA of \({\rho }_{{A}_{1}{A}_{i}}\) for i = 2, …, N.
Tight monogamy constraints of multi-qubit entanglement in terms of unified entanglement
In this section, we establish a class of tight monogamy inequalities of multi-qubit entanglement using the α’th power of UE. Before we present our main results, we first provide some notations, definitions and a lemma, which are useful throughout this paper.
For any nonnegative integer j whose binary expansion is
where \({\mathrm{log}}_{2}\,j\le n\) and ji ∈ {0, 1} for i = 0, …, n − 1, we can always define a unique binary vector associated with j, which is defined as
For the binary vector \(\overrightarrow{j}\) in Eq. (11), its Hamming weight, \({\omega }_{H}(\overrightarrow{j})\), is the number of 1’s in its coordinates29. We also provide the following lemma whose proof is easily obtained by some straightforward calculus.
Lemma 1.
For \(x\in [0,\,1]\) and nonnegative real numbers α, β, we have
for α ≥ 1, and
for 0 ≤ β ≤ 1.
Now we provide our first result, which states that a class of tight monogamy inequalities of multi-qubit entanglement can be established using the α-powered UE and the Hamming weight of the binary vector related with the distribution of subsystems.
Theorem 2.
For α ≥ 1, q ≥ 2 and 0 ≤ s ≤ 1, qs ≤ 3, we have
for any multi-qubit state \({\rho }_{A{B}_{0}\cdots {B}_{N-1}}\) where \(\overrightarrow{j}=({j}_{0},\ldots ,{j}_{n-1})\) is the vector from the binary representation of j and \({\omega }_{H}(\overrightarrow{j})\) is the Hamming weight of \(\overrightarrow{j}\).
Proof.
Without loss of generality, we may assume that the ordering of the qubit subsystems B0, …, BN−1 satisfies
for each j = 0, …, N − 2 by reordering and relabeling them, if necessary. From the monotonicity of the function f(x) = xα for α ≥ 1 and the UE-based monogamy inequality of multi-qubit entanglement in (8), we have
which makes it feasible to prove the theorem by showing
We first prove Inequality (17) for the case that N = 2n, a power of 2, by using mathematical induction on n, and extend the result for any positive integer N.
For n = 1 and a three-qubit state \({\rho }_{A{B}_{0}{B}_{1}}\) with two-qubit rduced density matrices \({\rho }_{A{B}_{0}}\) and \({\rho }_{A{B}_{1}}\), we have
where Inequalities (12) and (15) implies
From Eq. (18) and Inequality (19), we have
which recovers Inequality (17) for n = 1.
Now let us assume Inequality (17) is true for N = 2n−1 with n ≥ 2, and consider the case that N = 2n. For an (N + 1)-qubit state \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\) with its two-qubit reduced density matrices \({\rho }_{A{B}_{j}}\) with j = 0, …, N − 1, we have
Because the ordering of subsystems in Inequality (15) implies
Inequality (12) and Eq. (21) lead us to
From the induction hypothesis, we have
Moreover, the last summation in Inequality (23) is also a summation of 2n−1 terms starting from j = 2n−1 to j = 2n − 1. Thus, (after possible indexing and reindexing subsystems, if necessary) the induction hypothesis also leads us to
Inequalities (23), (24) and (25) recover Inequality (17) for N = 2n.
Now let us consider an arbitrary positive integer N and a (N + 1)-qubit state \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\). We first note that we can always consider a power of 2, which is an upper bound of N, that is, 0 ≤ N ≤ 2n for some n. We also consider a (2n + 1)-qubit state
which is a product of \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\) and an arbitrary (2n − N)-qubit state \({\sigma }_{{B}_{N}\cdots {B}_{{2}^{n}-1}}\).
Because \({{\rm{\Gamma }}}_{A{B}_{0}{B}_{1}\cdots {B}_{{2}^{n}-1}}\) is a (2n + 1)-qubit state, we have
where \({{\rm{\Gamma }}}_{A{B}_{j}}\) is the two-qubit reduced density matric of \({{\rm{\Gamma }}}_{A{B}_{0}{B}_{1}\cdots {B}_{{2}^{n}-1}}\) for each j = 0, …, 2n − 1. On the other hand, the separability of \({{\rm{\Gamma }}}_{A{B}_{0}{B}_{1}\cdots {B}_{{2}^{n}-1}}\) with respect to the bipartition between AB0 \(\cdots \) BN−1 and \({B}_{N}\cdots {B}_{{2}^{n}-1}\) assures
for j = N, …, 2n − 1, and
for each j = 0, …, N − 1. Thus, Inequality (27) together with Eqs (28) and (29) leads us to
and this completes the proof.□
We also note that, for any α ≥ 1 and the Hamming weight \({\omega }_{H}(\overrightarrow{j})\) of the binary vector \(\overrightarrow{j}=({j}_{0},\ldots ,{j}_{n-1})\), \({\alpha }^{{\omega }_{H}(\overrightarrow{j})}\) is greater than or equal to 1, therefore
for any multi-qubit state \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\) and α ≥ 1.
For the validity of Inequality (14) in multi-party higher-dimensional quantum systems more than qubits, let us consider the counterexample of CKW inequality in three-qutrit systems20
Here we would like to remark that, for a selective choice of q and s as well as α, Inequality (14) still holds for the counterexample of CKW inequality in Eq. (32); we first note that the two-qutrit reduced density matrix ρAB of \({|\psi \rangle }_{ABC}\) in Eq. (32) has a spectral decomposition,
where
By the Hughston-Jozsa-Wootters (HJW) theorem30, any pure state ensemble of ρAB can be realized as a superposition of \({|x\rangle }_{AB}\), \({|y\rangle }_{AB}\) and \({|z\rangle }_{AB}\). Moreover, it is also straightforward to check that for arbitrary pure states |ϕ〉AB = c1|x〉AB + c2|y〉AB + c3|z〉AB with |c1|2 + |c2|2 + |c3|2 = 1, its reduced density matrix σA = trB|ϕ〉AB 〈ϕ| has the same spectrum \(\{\frac{1}{2},\frac{1}{2},0\}\). Thus we have
For the choice of s = 0 and q = 3, the unified-(q, s) entropy in Eq. (1) is reduced to \({S}_{3,0}(\rho )=-\,\frac{1}{2}\,\mathrm{log}\,{\rm{tr}}\,{\rho }^{3}\), thus we have \({E}_{3,0}({\rho }_{A|B})=-\,\frac{1}{2}\,\mathrm{log}\,{\rm{tr}}\,{\sigma }_{A}^{3}=1\), where the symmetry of \({|\psi \rangle }_{ABC}\) under the permutation of subsystems, regardless of the global phase, also guarantees E3,0(ρA|C) = 1. (For calculation simplicity, we used the logarithmic function based on 2 throughout this paper, which does not affect on the validity of monogamy and polygamy inequalities). Now, we have
for any α ≥ 4, which shows that Inequality (14) still holds for the counterexample of CKW inequality in Eq. (32) for a selective choice of q and s as well as α.
We also note that an analogous argument can be made to show the validity of Inequality (14) for the other counterexample of CKW inequality in \(3\otimes 2\otimes 2\) quantum systems8. Thus Theorem 2 provides us with a new class of tight monogamy inequalities of multi-qubit entanglement even without any concrete counterexample in higher-dimensional quantum systems more that qubits.
The following theorem shows that Inequality (14) of Theorem 2 can be even improved to be a tighter inequality with some condition on two-qubit entanglement;
Theorem 3.
For α ≥ 1, q ≥ 2, 0 ≤ s ≤ 1, qs ≤ 3 and any multi-qubit state \({\rho }_{A{B}_{0}\cdots {B}_{N-1}}\), we have
conditioned that
for i = 0, …, N − 2.
Proof.
Due to Inequality (16), it is enough to show
and we use mathematical induction on N. We further note that Inequality (20) in the proof of Theorem 2 assures that Inequality (39) is true for N = 2.
Now let us assume the validity of Inequality (39) for any positive integer less than N. For a multi-qubit state \({\rho }_{A{B}_{0}\cdots {B}_{N-1}}\), we have
where Inequality (12) and the condition in Inequality (38) lead Inequality (40) to
Thus Eq. (40) and Inequality (41) imply
where the second inequality is due to the induction hypothesis, and this complete the theorem.□
For any nonnegative integer j and its corresponding binary vector \(\overrightarrow{j}\), the Hamming weight \({\omega }_{H}(\overrightarrow{j})\) is bounded above by \({\mathrm{log}}_{2}\,j\). Thus we have
which implies
for any α ≥ 1. In other words, Inequality (14) in Theorem 2 can be made to be even tighter as Inequality (37) of Theorem 3 for any multi-qubit state \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\) satisfying the condition in Inequality (38).
Tight polygamy constraints of multi-qubit entanglement in terms of unified entanglement of assistance
As a dual property to the Inequality (14) of Theorem 2, we provide a class of polygamy inequalities of multi-qubit entanglement in terms of powered UEoA.
Theorem 4.
For 0 ≤ β ≤ 1, −q2 + 4q − 3 ≤ s ≤ 1 on 1 ≤ q ≤ 2 and any multi-qubit state \({\rho }_{A{B}_{0}\cdots {B}_{N-1}}\), we have
Proof.
Without loss of generality, we assume the ordering of the qubit subsystems B0, …, BN−1 satisfying
for each j = 0, …, N − 2. Moreover, due to the monotonicity of the function f(x) = xβ for 0 ≤ β ≤ 1 and the UEoA-based multi-qubit polygamy inequality in (9), we have
thus it is enough to show that
The proof method is similar to that of Theorem 2; we first prove Inequality (48) for the case that N = 2n by using mathematical induction on n, and generalize the result to any positive integer N. For n = 1 and a three-qubit state \({\rho }_{A{B}_{0}{B}_{1}}\) with two-qubit rduced density matrices \({\rho }_{A{B}_{0}}\) and \({\rho }_{A{B}_{1}}\), we have
which, together with Inequalities (13) and (46) leads us to
Inequality (50) recovers Inequality (48) for n = 1.
Now we assume the validity of Inequality (48) for N = 2n−1 with n ≥ 2, and consider the case that N = 2n. For an (N + 1)-qubit state \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\) and its two-qubit reduced density matrices \({\rho }_{A{B}_{j}}\) with j = 0, …, N − 1, we have
where the ordering of subsystems in Inequality (46) and Inequality (13) together with Eq. (51) lead us to
Because each summation on the right-hand side of Inequality (52) is a summation of 2n−1 terms, the induction hypothesis assures that
and
(Possibly, we may index and reindex subsystems to get Inequality (54), if necessary). Thus, Inequalities (52), (53) and (54) recover Inequality (48) when N = 2n.
For an arbitrary positive integer N and a (N + 1)-qubit state \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\), we consider the (2n + 1)-qubit state \({{\rm{\Gamma }}}_{A{B}_{0}{B}_{1}\cdots {B}_{{2}^{n}-1}}\) in Eq. (26). Because \({{\rm{\Gamma }}}_{A{B}_{0}{B}_{1}\cdots {B}_{{2}^{n}-1}}\) is a (2n + 1)-qubit state, we have
where \({{\rm{\Gamma }}}_{A{B}_{j}}\) is the two-qubit reduced density matric of \({{\rm{\Gamma }}}_{A{B}_{0}{B}_{1}\cdots {B}_{{2}^{n}-1}}\) for each j = 0, …, 2n − 1.
Moreover, \({{\rm{\Gamma }}}_{A{B}_{0}{B}_{1}\cdots {B}_{{2}^{n}-1}}\) is a product state of \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\) and \({\sigma }_{{B}_{N}\cdots {B}_{{2}^{n}-1}}\), which implies
for j = N, …, 2n − 1, and
for each j = 0, …, N − 1. Thus Inequality (55) together with Eqs (56) and (57) recovers Inequality (45), and this completes the proof.
To illustrate the tightness of Inequality (45) in Theorem 4, let us first recall the general polygamy inequality of entanglement in arbitrary-dimensional multi-party quantum systems16;□
for any multi-party quantum state \({\rho }_{{A}_{1}{A}_{2}\cdots {A}_{n}}\), where Ea(ρA|B) is EoA of ρAB in Eq. (7).
Now let us consider the three-qubit W-state
where \({E}^{a}({|W\rangle }_{A|BC})=S({\rho }_{A})=\,\mathrm{log}\,3-\frac{2}{3}\) and the EoA of the two-qubit reduced density matrices are \({E}^{a}({\rho }_{A|B})=\)\({E}^{a}({\rho }_{A|C})=\frac{2}{3}\)31. Thus, the marginal EoA from Inequality (58) is
For q tends to 1, the unified-(q, s) entanglement is reduced to EoA as in Eq. (7), therefore the marginal UEoA from Inequality (45) for three-qubit, W-state when q = 1 and \(\beta =\frac{1}{3}\) or \(\frac{1}{4}\) are
Thus Inequality (45) is generally tighter than Inequality (58), which also delivers better bounds to characterize the W-class type three-party entanglement by means of bipartite ones.
We further note that an analogous argument for the improvement of monogamy inequalities from Theorem 2 to Theorem 3 can also be applied to Inequality (45) of Theorem 4 for a tighter class of polygamy inequalities with some condition on two-qubit entanglement of assistance.
Theorem 5.
For 0 ≤ β ≤ 1, −q2 + 4q − 3 ≤ s ≤ 1 on 1 ≤ q ≤ 2 and any multi-qubit state \({\rho }_{A{B}_{0}\cdots {B}_{N-1}}\), we have
conditioned that
for i = 0, …, N − 2.
From Inequality (43), we have \({\omega }_{H}(\overrightarrow{j})\le j\) for any nonnegative integer j and its corresponding binary vector \(\overrightarrow{j}\), therefore
for 0 ≤ β ≤ 1. Thus, Inequality (62) of Theorem 5 is tighter than Inequality (45) of Theorem 4 for 0 ≤ β ≤ 1 and any multi-qubit state \({\rho }_{A{B}_{0}{B}_{1}\cdots {B}_{N-1}}\) satisfying the condition in Inequality (63).
Discussion
Since its inception, understanding the nature of quantum entanglement is at the heart of quantum information theory. Although entanglement in bipartite quantum systems has been well studied with rich understanding, the situation becomes far more difficult for the case of multi-partite quantum entanglement, and only few are known for its characterization as well as its quantification. On the other hand, the saturation of monogamy and polygamy inequalities of multi-party entanglement provide us with an efficient way of characterizing multi-party quantum entanglements among different classes, because the genuine multi-party entanglement of this type can be completely characterized by means of the two-way (bipartite) entanglement within it. Thus it is an important task to have proper bipartite entanglement quantifications showing tight monogamy and polygamy inequalities for an efficient characterization of entanglements from different classes in multi-party and even in high-dimensional quantum systems.
Here we have provided a characterization of multi-qubit entanglement monogamy and polygamy constraints in terms of non-negative power of entanglement measures based on unified entropy. Using the Hamming weight of the binary vector related with the distribution of subsystems, we have established a class of monogamy inequalities of multi-qubit entanglement based on the αth-power of UE for α ≥ 1. We have also established a class of polygamy inequalities of multi-qubit entanglement in terms of the βth-power of UEoA for 0 ≤ β ≤ 1.
Our results deal with the full range of non-negative power of the most general class of bipartite entanglement measures based on unified-(q, s) entropy to establish monogamy and polygamy inequalities of multi-qubit entanglement, therefore our results encapsulate the results of various entropy-based monogamy and polygamy inequalities as special cases. For a selective choice of parameters q, s and α, our class of monogamy inequalities are also valid for the counterexamples of CKW monogamy inequality in higher-dimensional systems more than qubits.
We also remark that the class of monogamy and polygamy inequalities established here hold in a tighter way than other multi-qubit entanglement inequalities provided so far. Thus our results can provide an efficient way of characterizing entanglement shareability and distribution among the multi-party quantum systems without any known counterexample even in higher-dimensional systems more than qubits.
References
Terhal, B. M. Is entanglement monogamous? IBM J. Research and Development 48, 71 (2004).
Kim, J. S., Gour, G. & Sanders, B. C. Limitations to sharing entanglement. Contemp. Phys. 53(5), 417–432 (2012).
Bennett, C. H. & Brassard, G. Quantum Cryptography Public Key Distribution and Coin Tossing. In Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, p. 175–179 (IEEE Press, New York, Bangalore, India, 1984).
Bennett, C. H. Quantum cryptography using any two nonorthogonal states. Phys. Rev. Lett. 68, 3121 (1992).
Coleman, A. J. & Yukalov, V. I. Reduced Density Matrices. Coulson’s Challenge. Lecture Notes in Chemistry Vol. 72 (Springer-Verlag, Berlin, 2000).
Coffman, V., Kundu, J. & Wootters, W. K. Distributed entanglement. Phys. Rev. A 61, 052306 (2000).
Osborne, T. & Verstraete, F. General monogamy inequality for bipartite qubit entanglement. Phys. Rev. Lett. 96, 220503 (2006).
Kim, J. S., Das, A. & Sanders, B. C. Entanglement monogamy of multipartite higher-dimensional quantum systems using convex-roof extended negativity. Phys. Rev. A 79, 012329 (2009).
Kim, J. S. & Sanders, B. C. Monogamy of multi-qubit entanglement using Rényi entropy. J. Phys. A: Math. and Theor. 43, 445305 (2010).
Kim, J. S. Tsallis entropy and entanglement constraints in multiqubit systems. Phys. Rev. A 81, 062328 (2010).
Kim, J. S. & Sanders, B. C. Unified entropy, entanglement measures and monogamy of multi-party entanglement. J. Phys. A: Math. and Theor. 44, 295303 (2011).
Gour, G., Meyer, D. A. & Sanders, B. C. Deterministic entanglement of assistance and monogamy constraints. Phys. Rev. A 72, 042329 (2005).
Gour, G., Bandyopadhay, S. & Sanders, B. C. Dual monogamy inequality for entanglement. J. Math. Phys. 48, 012108 (2007).
Buscemi, F., Gour, G. & Kim, J. S. Polygamy of distributed entanglement. Phys. Rev. A 80, 012324 (2009).
Kim, J. S. Unification of multiqubit polygamy inequalities. Phys. Rev. A. 85, 032335 (2012).
Kim, J. S. General polygamy inequality of multiparty quantum entanglement. Phys. Rev. A 85, 062302 (2012).
Kim, J. S. Tsallis entropy and general polygamy of multiparty quantum entanglement in arbitrary dimensions. Phys. Rev. A 94, 062338 (2016).
Dür, W., Vidal, G. & Cirac, J. I. Three qubits can be entangled in two inequivalent ways. Phys. Rev. A 62, 062314 (2000).
Greenberger, D. M., Horne, M. A. & Zeilinger, A. Bell’s Theorem, Quantum Theory, and Conceptions of the Universe, edited by Kafatos, M. p. 69 (Kluwer, Dordrecht, 1989).
Ou, Y. Violation of monogamy inequality for higher-dimensional objects. Phys. Rev. A 75, 034305 (2007).
Zhu, X. N. & Fei, S. M. Entanglement monogamy relations of qubit systems. Phys. Rev. A 90, 024304 (2014).
Jin, Z. X. & Fei, S. M. Tighter entanglement monogamy relations of qubit systems. Quantum Inf. Process. 16, 77 (2017).
Kim., J. S. Negativity and tight constraints of multi-qubit entanglement. Phys. Rev. A 97, 012334 (2018).
Hu, X. & Ye, Z. Generalized quantum entropy. J. Math. Phys. 47, 023502 (2006).
Rastegin, A. E. Some general properties of unified entropies. J. Stat. Phys. 143, 1120–1135 (2011).
Horodecki, R., Horodecki, P. & Horodecki, M. Quantum α-entropy inequalities: independent condition for local realism? Phys. Lett. A 210, 377 (1996).
Rényi, A. On Measures of Entropy and Information. Proceedings of the Fourth Berkeley Symposium on Mathematics, Statistics and Probability 1, p. 547–561 (University of California Press, Berkeley, 1961).
Tsallis, C. Possible generalization of Boltzmann-Gibbs statistics. J. Stat. Phys. 52, 479 (1988).
Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information. (Cambridge University Press, Cambridge, 2000).
Hughston, L. P., Jozsa, R. & Wootters, W. K. A complete classification of quantum ensembles having a given density matrix. Phys. Lett. A 183, 14 (1993).
Kim., J. S. Weighted polygamy inequalities of multiparty entanglement in arbitrary-dimensional quantum systems. Phys. Rev. A 97, 042332 (2018).
Acknowledgements
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2017R1D1A1B03034727).
Author information
Authors and Affiliations
Contributions
J.S.K. conceived the idea, performed the calculations and the proofs, interpreted the results, and wrote down the manuscript.
Corresponding author
Ethics declarations
Competing Interests
The author declares no competing interests.
Additional information
Publisher's note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Kim, J.S. Hamming weight and tight constraints of multi-qubit entanglement in terms of unified entropy. Sci Rep 8, 12245 (2018). https://doi.org/10.1038/s41598-018-30766-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-018-30766-2
This article is cited by
-
Monogamy and polygamy for the generalized W-class states using unified-(q, s) entropy
Science China Physics, Mechanics & Astronomy (2024)
-
Tightening monogamy and polygamy relations of unified entanglement in multipartite systems
Quantum Information Processing (2022)
-
Tighter monogamy relations in multiparty quantum systems
Quantum Information Processing (2022)
-
Unified monogamy relation of entanglement measures
Quantum Information Processing (2021)
-
Tighter monogamy and polygamy relations of multiparty quantum entanglement
Quantum Information Processing (2020)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.