This paper derives tighter monogamy and polygamy relations for multiparty quantum entanglement, providing improved bounds that enhance understanding of entanglement distribution in quantum systems.
Contribution
It introduces new tight monogamy and polygamy relations with larger lower bounds and smaller upper bounds, respectively, using bipartite entanglement measures and entanglement of assistance.
Findings
01
New monogamy relations with larger lower bounds.
02
New polygamy relations with smaller upper bounds.
03
Relations are tighter than previous results.
Abstract
We investigate the tight monogamy and polygamy relations of multiparty entanglement for arbitrary quantum states. By using the power of the bipartite measure of entanglement, we establish a class of tight monogamy relations of multiparty entanglement with larger lower bounds than the existing monogamy relations. We also give a class of tight polygamy relations of multiparty entanglement with smaller upper bounds than the existing polygamy relations, by using the power of the entanglement of assistance. It is shown that these new monogamy and polygamy relations are tighter than the former results.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Tighter monogamy and polygamy relations of multiparty quantum entanglement
College of Mathematics and Information Science, Hebei
Normal University, Shijiazhuang 050024, China
Abstract
We investigate the tight monogamy and polygamy relations of multiparty entanglement for arbitrary quantum states. By using the power of the bipartite measure of entanglement, we establish a class of tight monogamy relations of multiparty entanglement with larger lower bounds than the existing monogamy relations. We also give a class of tight polygamy relations of multiparty entanglement with smaller upper bounds than the existing polygamy relations, by using the power of the entanglement of assistance. It is shown that these new monogamy and polygamy relations are tighter than the former results.
pacs:
03.67.Mn, 03.65.Ud, 03.67.-a
I INTRODUCTION
An important property of entanglement is the monogamy of entanglement (MOE) [1, 2]. It says that entanglement cannot be freely shared unconditionally among the multipartite quantum systems. For example, for three two-level quantum systems, denoted by A, B and C, if A and B are in a maximally entangled state ∣Ψ−⟩=(∣01⟩−∣10⟩)/2, then *A *cannot be entangled to C. This indicates that it should obey some trade-off on the amount of entanglement between the pairs AB and AC. The first mathematical characterization of MOE was expressed as a form of inequality for three-qubit state in terms of squared concurrence, which was generalized to arbitrary multiqubit systems by Osborne and Verstraete [3]. Later, the same monogamy inequality was also generalized to other entanglement measures [4-10]. Monogamy relations will help us to a further understanding of the distribution of entanglement in multipartite systems. Moreover, it also plays an important role in quantum information theory [11], condensed-matter physics [12] and even black-hole physics [13].
On the other hand the assisted entanglement, which is a dual amount to bipartite entanglement measures, is also shown to have a polygamous of entanglement (POE). POE can be considered as another kind of entanglement constraints in multiparty quantum systems. A polygamy inequality was first established for arbitrary multiqubit systems by using the squared concurrence of assistance [14-16]. Later, it was shown that the same polygamy inequality was also generalized in terms of various assisted entanglements [17-19]. Recently, a class of tight monogamy relations and polygamy relations were derived in multiparty quantum systems [20-28]. In this paper, we establish new classes of tight monogamy and polygamy relations of multiparty entanglement for arbitrary quantum states, based on the power of the bipartite measure of entanglement and the entanglement of assistance. We show that these new monogamy and polygamy relations are tighter than the results in [20-27].
II tighter monogamy relations of multiparty quantum entanglement
We denote the state of a multipartite system with a finite dimensional Hilbert space HA⊗HB1⊗⋯⊗HBN−1 by ρA∣B1⋯BN−1. Given any a bipartite entanglement measure E of the quantum states, E is said to be monogamous if the following inequality is satisfied
[TABLE]
where ρA∣Bi=trB1⋯Bi−1Bi+1⋯BN−1(ρA∣B1⋯BN−1), αc is the infimum exponent for Eαc to be monogamous. In order to investigate the monogamy relations of multiparty quantum entanglement, we need the following lemmas.
Lemma 1. For x≥m≥1 and μ≥1, then
[TABLE]
Proof. Let f(μ,x)=(1+x)μ−xμ. Then, ∂x∂f=μ[(1+x)μ−1−xμ−1]. When x≥m≥1 and μ≥1, it is obviously that (1+x)μ−1≥xμ−1. Thus, ∂x∂f≥0, f(μ,x) is an increasing function of x, i.e. f(μ,x)≥f(μ,m)=(m+1)μ−mμ. Thus we have (1+x)μ≥xμ+(m+1)μ−mμ.
Lemma 2. For a1≥a2≥⋯≥an≥0 and μ≥1, then
[TABLE]
Proof. For the case that n=1, the inequality (3) is trivial. Now we assume n=m the inequality (3) holds with m>1 and consider the case that n=m+1. If am+1=0, the inequality is trivial. Otherwise, let τ=am+1a1+a2+⋯+am, since a1≥a2≥⋯≥am+1>0, then τ≥m,
[TABLE]
where the inequality is due to the inequality (2).
The induction hypothesis yields
[TABLE]
Combining inequalities (4) and (5), we have
[TABLE]
It implies that the inequality (3) holds for the case that n=m+1, which completes the proof of Lemma 2.
Theorem 1. For an N-party state ρA∣B1⋯BN−1∈HA⊗HB1⊗⋯⊗HBN−1, postulate Eαc is a monogamous entanglement measure of the quantum states. If E(ρA∣Bi)≥E(ρA∣Bi+1) for i=1,2,⋯,N−2, N≥3 then
[TABLE]
for η≥αc and t=αcη.
Proof. Without loss of generality, the condition E(ρA∣Bi)≥E(ρA∣Bi+1) can be always satisfied by relabeling the subsystems.
From the inequality (1), one has
[TABLE]
If E(ρA∣Bi)≥E(ρA∣Bi+1) for i=1,2,⋯,N−2, according to Lemma 2, one gets
[TABLE]
Remark 1. It is easy to verify that Theorem 1 is generally tighter than the monogamy relations in terms of the Hamming weight [27].
For later use we prove the following lemma.
Lemma 3. For 0≤x≤k1,k≥1, and μ≥1, then
[TABLE]
Proof. If x=0, the inequality is trivial. Otherwise, let f(μ,x)=xμ(1+x)μ−k+1kμx−1. Then, ∂x∂f=x2μμxμ−1[1+k+1k(μ−1)x−(1+x)μ−1]. When 0≤x≤k1,k≥1 and μ≥1, it is easy to check that 1+k+1k(μ−1)x≤(1+x)μ−1. Thus, ∂x∂f≤0, f(μ,x) is a decreasing function of x, i.e. f(μ,x)≥f(μ,k1)=(k+1)μ−(1+k+1μ)kμ. Thus we have (1+x)μ≥1+k+1kμx+[(k+1)μ−(1+k+1μ)kμ]xμ.
Since kx≥(kx)μ, for kx∈[0,1] and μ≥1, one gets 1+k+1kμx+[(k+1)μ−(1+k+1μ)kμ]xμ=1+k+1μ[kx−(kx)μ]+[(k+1)μ−kμ]xμ≥1+[(k+1)μ−kμ]xμ. Let g(μ,k)=(k+1)μ−kμ−2μ+1. So, ∂k∂g=μ[(k+1)μ−1−kμ−1]. If μ≥1 with k≥1, then ∂k∂g≥0, which implies that g(μ,k) is an increasing function of k, i.e. g(μ,k)≥g(μ,1)=0, we obtain (k+1)μ−kμ≥2μ−1. Altogether, we can get (1+x)μ≥1+k+1kμx+[(k+1)μ−(1+k+1μ)kμ]xμ≥1+[(k+1)μ−kμ]xμ≥1+(2μ−1)xμ.
Theorem 2. For arbitrary tripartite quantum state ρA∣B1B2∈HA⊗HB1⊗HB2, postulate Eαc is a monogamous entanglement measure of the quantum states.
(1) If E(ρA∣B1)≥γE(ρA∣B2), then
[TABLE]
(2) If γE(ρA∣B1)≤E(ρA∣B2), then
[TABLE]
for η≥αc, γ≥1, where t=αcη, k=γαc.
Proof. From the inequality (1), we can deduce
[TABLE]
If E(ρA∣B1)≥γE(ρA∣B2), according to Lemma 3, we get
[TABLE]
When γE(ρA∣B1)≤E(ρA∣B2), the similar proof gives the inequality (12).
Note that when E(ρA∣B1)≥E(ρA∣B2), γαc=k=1, we have
[TABLE]
When E(ρA∣B1)≤E(ρA∣B2), we can get the following inequality
[TABLE]
Theorem 3. For an N-party state ρA∣B1⋯BN−1∈HA⊗HB1⊗⋯⊗HBN−1,
and a monogamous entanglement measure Eαc, if E(ρA∣Bi)≥γl=i+1∑N−1E(ρA∣Bl) for i=1,2,⋯,m and γ′E(ρA∣Bj)≤l=j+1∑N−1E(ρA∣Bl) for j=m+1,⋯,N−2,∀1≤m≤N−3,N≥4, then
[TABLE]
for η≥αc, γ≥1, γ′≥1, where t=αcη, k=γαc, k′=γ′αc.
Proof. From Theorem 2, we can derive
[TABLE]
By iterative use of inequality (11), we have the second inequality. As a matter of fact, the conditions 1+k+1kμx+[(k+1)μ−(1+k+1μ)kμ]xμ≥1+[(k+1)μ−kμ]xμ and E(ρA∣Bi)≥γl=i+1∑N−1E(ρA∣Bl), i=1,2,⋯,m have been used.
With a similar procedure as γ′E(ρA∣Bj)≤l=j+1∑N−1E(ρA∣Bl) for j=m+1,⋯,N−2, one finds
[TABLE]
By using inequalities (18) and (19), we can obtain Theorem 3. In fact, we also use the condition 1+k′+1k′μx+[(k′+1)μ−(1+k′+1μ)k′μ]xμ≥1+[(k′+1)μ−k′μ]xμ.
We note that if E(ρA∣Bi)≥l=i+1∑N−1E(ρA∣Bl) for i=1,2,⋯,m and E(ρA∣Bj)≤l=j+1∑N−1E(ρA∣Bl) for j=m+1,⋯,N−2,∀1≤m≤N−3,N≥4, then γαc=k=1, γ′αc=k′=1, we can obtain
[TABLE]
III tighter polygamy relations of multiparty quantum entanglement
We use ρA∣B1⋯BN−1 denote the state of a multipartite system with a finite dimensional Hilbert space HA⊗HB1⊗⋯⊗HBN−1. Assume Ea is an entanglement of assistance of the quantum states which is defined in Refs. [14, 29]. Ea is said to be polygamy if the following inequality holds
[TABLE]
where ρA∣Bi=trB1⋯Bi−1Bi+1⋯BN−1(ρA∣B1⋯BN−1). For the given entanglement of assistance Ea, βc is the supremum exponent for Eaβc to be polygamy. We first prove the following conclusions.
Lemma 4. For x≥m≥1 and 0≤μ≤1, then
[TABLE]
Proof. Let f(μ,x)=(1+x)μ−xμ. Then, ∂x∂f=μ[(1+x)μ−1−xμ−1]. When x≥m≥1 and 0≤μ≤1, it is straightforward to verify that (1+x)μ−1≤xμ−1. Thus, ∂x∂f≤0, f(μ,x) is a decreasing function of x, i.e. f(μ,x)≤f(μ,m)=(m+1)μ−mμ. Thus we get (1+x)μ≤xμ+(m+1)μ−mμ.
Lemma 5. For a1≥a2≥⋯≥an≥0 and 0≤μ≤1, then
[TABLE]
Proof. We have already noted that the inequality (23) is true for the case that n=1. Now assume that n=m the inequality (23) holds with m>1. Thus we have
[TABLE]
Now consider the case that n=m+1. If am+1=0, the inequality is true. Otherwise, let τ=am+1a1+a2+⋯+am, since a1≥a2≥⋯≥am+1>0, then τ≥m,
[TABLE]
where the inequality holds due to the inequality (22).
Combining inequalities (24) and (25) yields
[TABLE]
In other words, the case that n=m+1 the inequality (23) is true, and the proof is completed.
Theorem 4. For an N-party state ρA∣B1⋯BN−1∈HA⊗HB1⊗⋯⊗HBN−1, suppose Eaβc is a polygamy entanglement of assistance of the quantum states. If Ea(ρA∣Bi)≥Ea(ρA∣Bi+1) for i=1,2,⋯N−2, N≥3 then
[TABLE]
for 0≤η≤βc and t=βcη.
Proof. Without loss of generality, we may assume that, by relabeling the subsystems if necessary, the condition Ea(ρA∣Bi)≥Ea(ρA∣Bi+1) holds. From the inequality (21), we can write
[TABLE]
If Ea(ρA∣Bi)≥Ea(ρA∣Bi+1) for i=1,2,⋯N−2, from
Lemma 5 it follows that
[TABLE]
Remark 2. It is easy to see that Theorem 4 is generally tighter than the polygamy relations in terms of the Hamming weight [22-25, 27].
Next, we present a mathematical result.
Lemma 6. For 0≤x≤k1,k≥1, and 0≤μ≤1, the following inequality holds
[TABLE]
Proof. If x=0, the inequality becomes trivial. Otherwise, let f(μ,x)=xμ(1+x)μ−(k+1)2k2μx−1. Then, ∂x∂f=x2μμxμ−1[1+(k+1)2k2(μ−1)x−(1+x)μ−1]. When 0≤x≤k1, k≥1 and 1≥μ≥0, it is easy to prove that 1+(k+1)2k2(μ−1)x≥(1+x)μ−1. Thus, ∂x∂f≥0, f(μ,x) is an increasing function of x, i.e. f(μ,x)≤f(μ,k1)=(k+1)μ−[(k+1)2kμ+1]kμ. Then (1+x)μ≤1+(k+1)2k2μx+((k+1)μ−[(k+1)2kμ+1]kμ)xμ holds.
Due to kx≤(kx)μ, for kx∈[0,1] and 1≥μ≥0, we find 1+(k+1)2k2μx+((k+1)μ−[(k+1)2kμ+1]kμ)xμ=1+(k+1)2kμ[kx−(kx)μ]+[(k+1)μ−kμ]xμ≤1+[(k+1)μ−kμ]xμ. Let g(μ,k)=(k+1)μ−kμ−2μ+1. So ∂k∂g=μ[(k+1)μ−1−kμ−1]. For 0≤μ≤1 and k≥1, we have ∂k∂g≤0, and it follows that g(μ,k) is a decreasing function of k, i.e. g(μ,k)≤g(μ,1)=0. Hence, one has (k+1)μ−kμ≤2μ−1. It is clear that μ≥2μ−1, for 1≥μ≥0. Collecting all these results we get (1+x)μ≤1+(k+1)2k2μx+((k+1)μ−[(k+1)2kμ+1]kμ)xμ≤1+[(k+1)μ−kμ]xμ≤1+(2μ−1)xμ≤1+μxμ.
Theorem 5. For arbitrary tripartite quantum state ρA∣B1B2∈HA⊗HB1⊗HB2, suppose Eaβc is a polygamy entanglement of assistance of the quantum states.
(1) If Ea(ρA∣B1)≥γEa(ρA∣B2), then
[TABLE]
(2) If γEa(ρA∣B1)≤Ea(ρA∣B2), then
[TABLE]
for 0≤η≤βc, γ≥1, where t=βcη, k=γβc.
Proof. From the inequality (21), one can deduce that
[TABLE]
If Ea(ρA∣B1)≥γEa(ρA∣B2), using Lemma 6 we find
[TABLE]
When γEa(ρA∣B1)≤Ea(ρA∣B2), the inequality (32) has a similar proof.
We need to note, if Ea(ρA∣B1)≥Ea(ρA∣B2), γβc=k=1, then we arrive at
[TABLE]
If Ea(ρA∣B1)≤Ea(ρA∣B2), then
[TABLE]
Theorem 6. For an N-party state ρA∣B1⋯BN−1∈HA⊗HB1⊗⋯⊗HBN−1,
and a polygamy entanglement of assistance Eaβc, if Ea(ρA∣Bi)≥γl=i+1∑N−1Ea(ρA∣Bl) for i=1,2,⋯,m and γ′Ea(ρA∣Bj)≤l=j+1∑N−1Ea(ρA∣Bl) for j=m+1,⋯,N−2,∀1≤m≤N−3,N≥4, then
[TABLE]
for 0≤η≤βc, γ≥1, γ′≥1, where t=βcη, k=γβc, k′=γ′βc.
Proof. From Theorem 5, we can deduce that
[TABLE]
Iterative use of inequality (31), we can get the second inequality. Here we are using the fact that 1+(k+1)2k2μx+((k+1)μ−[(k+1)2kμ+1]kμ)xμ≤1+[(k+1)μ−kμ]xμ and Ea(ρA∣Bi)≥γl=i+1∑N−1Ea(ρA∣Bl), i=1,2,⋯,m.
Following a similar procedure as γ′Ea(ρA∣Bj)≤l=j+1∑N−1Ea(ρA∣Bl) for j=m+1,⋯,N−2, we have
[TABLE]
Theorem 6 can be obtained by combining inequalities (38) with (39). We also use the fact that 1+(k′+1)2k′2μx+((k′+1)μ−[(k′+1)2k′μ+1]k′μ)xμ≤1+[(k′+1)μ−k′μ]xμ.
Let us note that if Ea(ρA∣Bi)≥l=i+1∑N−1Ea(ρA∣Bl) for i=1,2,⋯,m and Ea(ρA∣Bj)≤l=j+1∑N−1Ea(ρA∣Bl) for j=m+1,⋯,N−2,∀1≤m≤N−3,N≥4, then γβc=k=1, γ′βc=k′=1, it follows that
[TABLE]
To see the tightness of our inequalities, we give some examples below. We using the concurrence as a bipartite measure of entanglement, the concurrence of assistance as a bipartite entanglement of assistance.
Example 1: For the four-qubit W state [27]
[TABLE]
one finds that the concurrence C(∣φ⟩A∣BCD)=23, C(ρA∣B)=C(ρA∣C)=C(ρA∣D)=21 and the concurrence of assistance Ca(∣φ⟩A∣BCD)=23, Ca(ρA∣B)=Ca(ρA∣C)=Ca(ρA∣D)=21. The state (41) saturates the inequality (7) and (29), but the inequality in terms of the Hamming weight cannot reach the bound C(∣φ⟩A∣BCD)=Ca(∣φ⟩A∣BCD)=23. Thus Theorems 1 and 4 are better than the monogamy and polygamy relations in terms of the Hamming weight [22-25, 27].
Example 2: Under local unitary operations, the three-qubit pure state can be written as [30]
[TABLE]
where ι=−1, 0≤ϕ≤π, λs≥0, s=0,1,2,3,4, and ∑λs2=1.
Set λ0=21, λ1=λ4=122, λ2=22, λ3=32.
After some analysis of the concurrence, we can get C(ρA∣B)=32,C(ρA∣C)=22, C(∣φ⟩A∣BC)=Ca(∣φ⟩A∣BC)=12106. One can explicitly see that our lower bound is larger than the results in [20, 21, 26, 27], as illustrated in Fig.1.
Straightforward calculation of the concurrence of assistance, we have the Ca(ρA∣B)=1234,Ca(ρA∣C)=1274. One can explicitly see that our upper bound is smaller than the results in [22-27], as shown in Fig.2.
IV CONCLUSION
Multipartite entanglement can be regarded as a fundamental problem in the theory of quantum entanglement. It has attracted increasing interest over the last 20 years. Our results may contribute to a fuller understanding of the multiparty quantum entanglement. By using the power of the bipartite measure of entanglement and the entanglement of assistance, we have proposed a new class of tight monogamy and polygamy relations of multiparty entanglement for arbitrary quantum states. We show that these new monogamy relations of multiparty entanglement with larger lower bounds than the existing monogamy relations [20, 21, 26, 27], for η≥αc. For 0≤η≤βc, these new polygamy relations of multiparty entanglement with smaller upper bounds than the existing polygamy relations [22-27].
Acknowledgements.
This work was supported by the National Natural Science Foundation of China under Grant No: 11475054, the Hebei Natural Science Foundation of China under Grant No: A2018205125.
Bibliography30
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1(1) V. Coffman, J. Kundu, and W. K. Wootters, Phys. Rev. A 61 , 052306 (2000).
2(2) B. M. Terhal, IBM J. Res. Dev. 48 , 71 (2004).
3(3) T. J. Osborne and F. Verstraete, Phys. Rev. Lett. 96 , 220503 (2006).
4(4) Y. C. Ou and H. Fan, Phys. Rev. A 75 , 062308 (2007).
5(5) T. Hiroshima, G. Adesso, and F. Illuminati, Phys. Rev. Lett. 98 , 050503 (2007).
6(6) J. S. Kim, A. Das, and B. C. Sanders, Phys. Rev. A 79 , 012329 (2009).
7(7) A. Streltsov, G. Adesso, M. Piani, and D. Bruß, Phys. Rev. Lett. 109 , 050503 (2012).
8(8) Y. K. Bai, Y. F. Xu, and Z. D. Wang, Phys. Rev. Lett. 113 , 100503 (2014).