Pith. sign in

REVIEW 2 major objections 5 minor 30 references

Polygamy Inequalities for Qubit Systems

T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For any n-qubit state with two entangled reduced pairs, the α-th powers of concurrence and of entanglement of formation satisfy a polygamy inequality up to a state-dependent exponent α0 ∈ (0,2] (respectively (0,√2]).

desk verdict Correct but near-tautological: the polygamy threshold is a normalization artifact, and the result is thinner than the title suggests. read the letter →

arxiv 1908.06084 v1 pith:QSCYUASE submitted 2019-08-16 quant-ph

Xuena Zhu , Zhixiang Jin , Shaoming Fei This is my paper · ORCID
classification quant-ph MSC 81P40
keywords polygamyinequalitymonogamyofentanglementconcurrenceformationn-qubitstatesassistance
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper establishes that the α-th powers of concurrence and of entanglement of formation obey polygamy inequalities for n-qubit states, on an interval of positive powers rather than only for α≤0. Concretely, whenever at least two of the reduced two-qubit states ρ_ABi are entangled, there is a state-dependent α0∈(0,2] such that C^α(ρ_{A|B1...Bn-1})≤Σ_i C^α(ρ_ABi) for every 0≤α≤α0, and likewise E^α with α0∈(0,√2]. The proof runs through a continuity crossing: the right-hand sum starts at least 2, the left-hand side never exceeds 1, so the two sides stay ordered up to the first crossing. The result fills the gap between known polygamy at negative powers and known monogamy at high powers, giving a complete picture of how entanglement can be shared among all parties in a qubit system.

What carries the argument

The central device is the function f(α)=Σ_i X^α(ρ_ABi), with X=C or E, which sums the α-th powers of the pairwise reduced entanglements. At α=0, each entangled substate contributes 1, so two entangled substates give f(0)≥2; at the upper end, the known monogamy bounds Σ_i $C^{2}$(ρ_ABi)≤$C^{2}$(ρ_{A|B1...Bn-1}) and Σ_i $E^{{√2}}$(ρ_ABi)≤$E^{{√2}}$(ρ_{A|B1...Bn-1}) give f(2)≤1 and f(√2)≤1. Since f is continuous and non-increasing, it must cross the level 1 at some α0, and for all α below the crossing the right-hand side stays at least 1 while the left-hand side stays at most 1, forcing the polygamy inequality.

What would settle it

Numerically search a randomly generated n-qubit mixed state with at least two entangled reduced states and evaluate g(α)=Σ_i C^α(ρ_ABi)-C^α(ρ_{A|B...}) on a fine grid over [0,2]; the theorem requires g(α)≥0 on some initial interval [0,α0], so finding g(α)<0 for a sequence α approaching 0 would refute it, as would a state exhibiting a failure of the $E^{{√2}}$ monogamy bound.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2 for concurrence and Theorem 3 for entanglement of formation. For any n-qubit state ρ with reduced states ρ_ABi, if at least two of these reduced states are entangled, there exists a real number α0∈(0,2] such that for all 0≤α≤α0 the polygamy inequality C^α(ρ_{A|B1...Bn-1})≤Σ_{i=1}^{n-1} C^α(ρ_ABi) holds; for EoF the same statement holds with α0∈(0,√2]. The paper also derives an equality point α1 at which the two sides coincide, and assistance-based corollaries replacing C and E by their assistance versions. This extends the previously known polygamy relation for concurrence from α≤0 to the positive interval bounded by α0, and provides the first positive-power polygamy relation for EoF in general n-qubit states.

Load-bearing premise

The argument's load-bearing step is the previously known fact that squared concurrence and the $\sqrt{2}$-power of entanglement of formation are monogamous for n-qubit states; if that failed, the proof could not force the right-hand side down to 1 and would lose its crossing point.

Editorial extensions

If this is right

  • Every n-qubit state with at least two entangled reduced pairs has a nontrivial interval of positive powers on which concurrence is polygamous, not just the negative-power region known before.
  • Entanglement of formation gains a positive-power polygamy interval up to α0≤√2, complementing the monogamy region α≥√2.
  • The assistance variants (Corollaries 1 and 3) put the same polygamy guarantee on concurrence of assistance and entanglement of assistance, measures that appear when one party helps another create entanglement.
  • For states where the crossing parameter satisfies β0>1, the pure-state entanglement-of-assistance polygamy inequality extends beyond the previously available range 0≤β≤1.
  • Corollary 2 produces an exponent α1∈[α0,2] at which the two sides are exactly equal, marking the transition from polygamous to monogamous ordering for the given state.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial observation: the existence of a positive α0 is more robust than the proof suggests. Because f(0)≥2 and the left-hand side is at most 1, continuity alone guarantees the inequality on some small interval; the known monogamy bounds only determine where the crossing sits, not whether an interval exists.
  • The same continuity crossing should apply to any entanglement monotone normalized to at most 1 on the relevant bipartition, suggesting a general recipe for proving polygamy intervals for other measures.
  • The worked examples give α0≈1.7095 for a three-qubit mixture and ≈0.7836 for a four-qubit generalized W state; comparing such cutoffs across families could reveal how the guaranteed polygamy range shrinks as entanglement is spread more evenly, but the paper does not study this trend.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper claims to establish polygamy-type inequalities for n-qubit states. For the concurrence C, Theorem 2 states that if at least two reduced bipartite states ρ_ABi are entangled, then there exists a state-dependent α0 ∈ (0,2] such that C^α(ρ_A|B1...B_{n-1}) ≤ Σ_i C^α(ρ_ABi) for all 0 ≤ α ≤ α0; Theorem 3 gives the analogous statement for the entanglement of formation E with α0 ∈ (0,√2]. The proofs define f(α) = Σ_i C^α(ρ_ABi) (or E^α), use f(0) ≥ 2, f(2) ≤ 1 (or f(√2) ≤ 1) from known monogamy inequalities, and invoke continuity and monotonicity to find a crossing α0 with f(α0) = 1. Corollaries for concurrence of assistance and entanglement of assistance, and equality statements, are derived. Numerical examples for three- and four-qubit W-type states illustrate the thresholds.

Significance. The proofs are short and correct as far as they go, and the paper gives concrete numerical illustrations. However, the central result is a generic continuity observation: the assumptions needed are only normalization (C,E ≤ 1), positivity of at least two reduced entanglements, and the elementary monotonicity of powers in [0,1]. The monogamy inequalities used in the proofs are not actually needed for the conclusion. Moreover, the state-dependent exponent α0 is not bounded below and can be arbitrarily small, so the claimed extension from α ≤ 0 to α ≤ α0 is potentially vacuous. If the authors supplied a nontrivial quantitative lower bound on α0, the result would be a meaningful contribution; without it, the paper's title and abstract overstate the significance. The explicit examples and corollaries are useful but do not change this assessment.

major comments (2)
  1. [Sec. II, Theorem 2 and Sec. III, Theorem 3] The proof of Theorem 2 (Eq. (7)) uses only f(0) ≥ 2, the continuity and monotonicity of f(α) = Σ C^α(ρ_ABi), and the bound C^α(ρ_A|B1...B_{n-1}) ≤ 1. The monogamy inequality f(2) ≤ 1 is not load-bearing: if f(2) > 1, the conclusion holds with α0 = 2; if f(2) ≤ 1, the crossing argument gives an α0. The same argument applies verbatim to any entanglement measure M with 0 ≤ M ≤ 1 and at least two nonzero reduced values, so the theorem is a normalization artifact rather than a property of qubit concurrence or of the specific bipartite structure. The paper should state this explicitly and frame the result as a continuity corollary for normalized entanglement measures, rather than as a qubit-specific polygamy relation.
  2. [Sec. II, Example 1 and Sec. III, Theorem 3] The parameter α0 is state-dependent and no lower bound is given. For two nonzero reduced concurrences ε and δ, f(α) = ε^α + δ^α, and the crossing condition f(α0) = 1 gives α0 of the order 1/log(1/εδ), which tends to 0 as ε,δ → 0. Thus the positive interval [0,α0] can be arbitrarily small while still satisfying the stated assumptions, making the claimed 'extension from α ≤ 0 to α ≤ α0' potentially of little content. The authors should either prove a quantitative state-dependent lower bound on α0 in terms of the reduced entanglements, or explicitly acknowledge that no such uniform bound exists and adjust the significance claims accordingly.
minor comments (5)
  1. [Sec. II, Theorem 1] The statement 'For any 2 ⊗ 2 ⊗ 2^{n-2} tripartite mixed state ρ_ABC' is not tripartite for n > 3; the third subsystem C is composite, so the notation should be clarified as a bipartite split A|BC with C comprising n-2 qubits.
  2. [Sec. II, after Theorem 1] The expression 'CABCAC' appears to be a typo; it should read C(ρ_AB)C(ρ_AC).
  3. [Sec. III, Example 3] The text says 'see Fig. 3' when referring to the EoF example, but the correct figure is Fig. 4.
  4. [References] References [14] and [15] contain duplicated titles ('Entanglement monogamy relations of qubit systems' appears twice).
  5. [Sec. III, Eq. (12)] The quantities β_i in Eq. (12) are used but not defined in this paper; they should be defined or the reference to Ref. [18] should be made explicit.

Circularity Check

1 steps flagged · score 8.0 of 10

Main polygamy inequality is a normalization artifact: α0 is defined as the root of the RHS sum equaling 1, so the claimed range is true by construction.

  1. self definitional [Theorem 2 proof, Sec. II; same construction in Theorem 1 proof and Theorem 3 proof, Secs. II–III]
    "Since C(ρABi1)C(ρABi2) ≠ 0, we have f(0) ≥ 2. Taking into account that f(α) is continuous, we have that there must be a real number α0 ∈ (0,2] such that f(α0) = 1. As f(α) is monotonically decreasing, we have f(α) ≥ 1 for α ∈ [0,α0]."

    The claimed polygamy inequality C^α(A|B1...Bn−1) ≤ Σ C^α(ρABi) for α ≤ α0 follows immediately from the construction of α0: α0 is chosen so that the right-hand side equals 1 at α0, and monotonicity makes the RHS ≥ 1 for all α ≤ α0, while the left-hand side is ≤ 1 for all α because concurrence (and EoF in Theorem 3) are normalized to ≤ 1 on the 2⊗2^{n−1} bipartition. Thus the theorem reduces to positivity (f(0) ≥ 2), continuity, monotonicity, and normalization; it holds for any [0,1]-valued entanglement measure with two positive bipartite reductions. The monogamy bound f(2) ≤ 1 (and the imported Ref. [14] E^√2 bound in Theorem 3) is not needed: if it fails, one simply takes α0 = 2 (or √2). The 'extension' is therefore by construction, not a structural entanglement-polygamy result.

full rationale

The paper's central claims (Theorems 1, 2, and 3) are formally derived, but the derivation is self-definitional: the state-dependent threshold α0 is defined as the point where the right-hand side Σ C^α(ρABi) equals 1. Since the left-hand side C^α(A|B1...Bn−1) is always at most 1 for a 2⊗2^{n−1} bipartition, the inequality is automatically true for α ≤ α0. The sole entanglement-specific ingredient used in the proof beyond normalization is the monogamy bound f(2) ≤ 1, but even that is not load-bearing: if f(2) > 1, one can take α0 = 2 and the inequality still holds by the same normalization argument. The same applies to the EoF version, where the E^√2 monogamy bound is imported from the authors' own Ref. [14]; it is unnecessary for the stated result. Consequently, the theorems carry no structural information about concurrence or EoF beyond the fact that these measures take values in [0,1] and that at least two reduced states are entangled. The 'polygamy inequalities for α ≤ α0' are therefore equivalent, by construction, to a trivial continuity-and-normalization corollary; no universal lower bound on α0 is provided, so the result cannot support the title's claim of extending polygamy to a positive parameter region in a meaningful way. This is not a case of self-citation being load-bearing, but the central prediction is forced by the definition of α0.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The only new parameter is the state-dependent threshold α0, defined implicitly; the theorems are immediate consequences of known monogamy inequalities plus the intermediate value theorem. No new physical entities are introduced.

free parameters (2)
  • α0 (state-dependent threshold for concurrence) = Root of Σ C^{α0}(ρ_ABi)=1; e.g., ≈1.70951 for W state in Example 1
    The theorem only proves existence via IVT. The threshold is defined implicitly by the state's reduced concurrences and must be computed per state; no closed-form or universal lower bound is given.
  • α0 (state-dependent threshold for EoF) = Root of Σ E^{α0}(ρ_ABi)=1; e.g., ≈1.15959 for W state in Example 3
    Same implicit definition for entanglement of formation; state-dependent and not universal.
assumptions (4)
  • domain assumption CKW squared-concurrence monogamy for n-qubit states: Σ_i C^2(ρ_ABi) ≤ C^2(ρ_A|B1...Bn-1)
    Used in proofs of Theorems 1 and 2 to assert f(2) ≤ 1.
  • domain assumption E^{√2} monogamy for n-qubit states from Ref. [14]
    Used in proof of Theorem 3 to assert f(√2) ≤ 1; this is a cited result from the authors' prior paper.
  • standard math Normalization bounds: for 2⊗2^{n-1} bipartitions, C ≤ 1 and E ≤ 1
    Used to conclude the left-hand side is at most 1, so polygamy reduces to the right-hand side being at least 1.
  • domain assumption For two-qubit states, E=0 if and only if C=0
    Used to infer f(0) ≥ 2 from the condition that at least two reduced concurrences are nonzero.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Polygamy Inequalities for Qubit Systems." pith.science (2026). https://pith.science/paper/QSCYUASE

@misc{pith2026190806084,
  author       = {Pith},
  title        = {Pith review of: Polygamy Inequalities for Qubit Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QSCYUASE}},
  note         = {Machine review of arXiv:1908.06084}
}
abstract

Entanglement polygamy, like entanglement monogamy, is a fundamental property of multipartite quantum states. We investigate the polygamy relations related to the concurrence $C$ and the entanglement of formation $E$ for general $n$-qubit states. We extend the results in [Phys. Rev. A 90, 024304 (2014)] from the parameter region $\alpha\leq0$ to $\alpha\leq\alpha_0$, where $0<\alpha_0\leq2$ for $C$, and $0<\alpha_0\leq\sqrt{2}$ for $E$.

Figures

Figures reproduced from arXiv: 1908.06084 by the authors.

Figure 1
Figure 1. FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2: The solid line is [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3: The solid line is [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: FIG. 4: The solid line is [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 28 canonical work pages

  1. [14]

    Guo, Any entanglement of assistance is polygamous, Qu antum Information Processing (2018) 17:222

    Y. Guo, Any entanglement of assistance is polygamous, Qu antum Information Processing (2018) 17:222

    work page 2018

  2. [1]

    15959, √

    15959, α ∈ (1. 15959, √

    work page

  3. [2]

    In this paper, we stu dy the polygamy inequalities of Cα for α ∈ (0, 2) and Eα for α ∈ (0, √ 2)

    power of entanglement of formation are still unknown. In this paper, we stu dy the polygamy inequalities of Cα for α ∈ (0, 2) and Eα for α ∈ (0, √ 2). II. POLYGAMY RELATIONS FOR CONCURRENCE For a bipartite pure state |ψ ⟩AB, the concurrence is given by [19–21], C(|ψ ⟩AB) = √ 2[1 −Tr (ρ2 A)], 2 whereρA is reduced density matrix obtained by tracing over the...

    work page

  4. [3]

    If CABCAC = 0, obviously we haveCα (ρA|BC ) ≥ max{Cα AB,C α AC } for any α ∈ [0, +∞)

    Specifically, for α ∈ (α 0, 2], from the proof of Theorem 1, we have Cα AB +Cα AC ≤ 1. If CABCAC = 0, obviously we haveCα (ρA|BC ) ≥ max{Cα AB,C α AC } for any α ∈ [0, +∞). Example 1. Let us consider the three-qubit state, ρABC = 1−t 8 I8 +t|ψ ⟩ABC ⟨ψ | witht ≥ 0. 783612, where |ψ ⟩ABC = 1√ 3 (|100⟩+ |010⟩ + |001⟩), and I8 is the 8 × 8 identity matrix. We ...

    work page

  5. [4]

    Since C(ρABi1 )C(ρABi2 ) ⁄= 0, we have E(ρABi1 )E(ρABi2 ) ⁄= 0, i.e., f (0) ≥ 2

    = ∑ n−1 i=1 E √ 2(ρABi ) ≤ E √ 2(ρA|B1...B n− 1) ≤ 1. Since C(ρABi1 )C(ρABi2 ) ⁄= 0, we have E(ρABi1 )E(ρABi2 ) ⁄= 0, i.e., f (0) ≥ 2. As f (α ) is continuous, there must be a real number α 0 ∈ (0, √ 2] so that f (α 0) = 1. Since f (α ) is monotonically decreasing, we havef (α ) ≥ 1 for α ∈ [0,α 0]. □ From Theorem 3, inequalities (10) and (11), we have th...

    work page

  6. [5]

    and α ≥ √ 2, respectively. Since E(|ϕ ⟩A|B1...B n− 1) = Ea(|ϕ ⟩A|B1...B n− 1) for any pure state |ϕ ⟩AB1...B n− 1, for pure states (14) becomes Eβ a (|ϕ ⟩A|B1B2...B n− 1) ≤ n−1∑ i=1 Eβ a (ρABi), (15) for 0 ≤β ≤β0, where β0 is a real number which satisfies ∑ n−1 i=1 Eβ 0(ρABi ) = 1. If β0> 1, we have Eβ a (|ϕ ⟩A|B1B2...B n− 1) ≤ n−1∑ i=1 Eβ a (ρABi ) ≤ n−1∑...

    work page

  7. [6]

    Mintert, M

    F. Mintert, M. Ku´ s, and A. Buchleitner, Concurrence of M ixed Bipartite Quantum States in Arbitrary Dimensions, Phy s. Rev. Lett. 92, 167902 (2004)

    work page 2004

  8. [7]

    K. Chen, S. Albeverio, and S. M. Fei, Concurrence of Arbit rary Dimensional Bipartite Quantum States,Phys. Rev. Lett . 95, 040504 (2005)

    work page 2005

Show all 30 references
  1. [8]

    H. P. Breuer, Optimal Entanglement Criterion for Mixed Q uantum States,Phys. Rev. Lett. 97, 080501 (2006)

    2006

  2. [9]

    J. I. de Vicente, Lower bounds on concurrence and separab ility conditions, Phys. Rev. A 75, 052320 (2007)

    2007

  3. [10]

    C. J. Zhang, Y. S. Zhang, S. Zhang, and G. C. Guo, Optimal en tanglement witnesses based on local orthogonal observ- ables,Phys. Rev. A 76, 012334 (2007)

    2007

  4. [11]

    M. A. Nielsen, and I. L. Chuang, Quantum Computation and Q uantum Information (Cambridge University Press, Cam- bridge, 2000)

    2000

  5. [12]

    Pawlowski, Security proof for cryptographic protoco ls based only on the monogamy of Bell’s inequality violation s, Phys

    M. Pawlowski, Security proof for cryptographic protoco ls based only on the monogamy of Bell’s inequality violation s, Phys. Rev. A 82, 032313 (2010)

    2010

  6. [13]

    Koashi, and A

    M. Koashi, and A. Winter, Monogamy of quantum entangleme nt and other correlations, Phys. Rev. A 69, 022309 (2004)

    2004

  7. [15]

    T. J. Osborne, and F. Verstraete, General Monogamy Ineq uality for Bipartite Qubit Entanglement, Phys. Rev. Lett. 96, 220503 (2006)

    2006

  8. [16]

    Y. K. Bai, M. Y. Ye, and Z. D. Wang, Entanglement monogamy and entanglement evolution in multipartite systems, Phys. Rev. A 80, 044301(2009)

    2009

  9. [17]

    Y. K. Bai, Y.F. Xu, and Z.D. Wang, General Monogamy Relat ion for the Entanglement of Formation in Multiqubit Systems, Phys. Rev. Lett. 113, 100503 (2014)

    2014

  10. [18]

    Coffman, J

    V. Coffman, J. Kundu, and W. K. Wootters, Distributed ent anglement, Phys. Rev. A 61, 052306 (2000)

    2000

  11. [19]

    X. N. Zhu and S. M. Fei, Entanglement monogamy relations of qubit systems, Entanglement monogamy relations of qubit systems, Phys. Rev. A 90, 024304 (2014)

    2014

  12. [20]

    Z. X. Jin, J. Li, T. Li and S. M. Fei, Tighter monogamy rela tions in multiqubit systems, Tighter monogamy relations in multiqubit systems, Phys. Rev. A 97, 032336 (2018)

    2018

  13. [21]

    J. S. Kim, Negativity and tight constraints of multiqub it entanglement, Phys. Rev. A 97, 012334 (2018)

    2018

  14. [22]

    Goura, S

    G. Goura, S. Bandyopadhyayb, and B. C. Sandersc, J. Math .Phys. 48, 012108 (2007)

    2007

  15. [23]

    J. S. Kim, Weighted polygamy inequalities of multipart y entanglement in arbitrary-dimensional quantum systems, Phys. Rev. A 97, 042332 (2018)

    2018

  16. [24]

    Uhlmann, Fidelity and concurrence of conjugated sta tes, Phys

    A. Uhlmann, Fidelity and concurrence of conjugated sta tes, Phys. Rev. A 62, 032307 (2000)

    2000

  17. [25]

    Rungta, V

    P. Rungta, V. Buˇ zek, C. M. Caves, M. Hillery, and G. J. Mi lburn, Universal state inversion and concurrence in arbitr ary dimensions, Phys. Rev. A 64, 042315 (2001)

    2001

  18. [26]

    Albeverio, S

    S. Albeverio, S. M. Fei, A note on invariants and entangl ements, J Opt B: Quantum Semiclass Opt. 3, 223 (2001)

    2001

  19. [27]

    C. S. Yu, and H. S. Song, Entanglement monogamy of tripar tite quantum states ,Phys. Rev. A 77, 032329 (2008)

    2008

  20. [28]

    C. H. Bennett, H. J. Bernstein, S. Popescu, and B. Schuma cher, Concentrating partial entanglement by local operati ons, Phys. Rev. A 53, 2046 (1996)

    1996

  21. [29]

    C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wo otters, Mixed-state entanglement and quantum error correction, Phys. Rev. A 54, 3824 (1996)

    1996

  22. [30]

    J. S. Kim, General polygamy inequality of multiparty qu antum entanglement, Phys. Rev. A 85, 062302 (2012)

    2012

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.