{"id":"a6955355-0443-4cc0-aff9-a8e296889e3e","arxiv_id":"1908.06084","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"low","formal_verification":"none","parameter_count":2,"one_line_summary":"For any n-qubit state with at least two entangled reduced states, entanglement polygamy inequalities for concurrence and entanglement of formation hold for all exponents from 0 up to a state-dependent positive threshold.","lead":"This paper proves that certain entanglement 'polygamy' inequalities, once known only for negative powers, also hold for small positive powers up to a state-dependent cutoff. The result is a small extension of existing monogamy and polygamy results for multi-qubit states.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The main theorems are true but near-tautological: the proof needs no monogamy bound, only normalization and at least two positive reduced entanglements, so the result is a generic feature of any [0,1]-valued measure.","rationale":"The paper's central claim is mathematically correct. Theorems 1-3 are valid, and the examples check out. My stress-test focused on whether the proof's input assumptions are load-bearing. The reader's weakest_assumption pointed to the monogamy bound for EoF from Ref [14]. On inspection, this bound is not actually needed for the existence of α0. If the bound failed and f(√2)>1, one would simply take α0=√2, and the inequality holds because the LHS is at most 1 while the RHS is at least f(√2)>1. Therefore, the theorem is a direct consequence of continuity, monotonicity, and the fact that all entanglement values lie in [0,1] with at least two positive ones. This makes the result near-tautological: it does not reflect any genuine polygamous structure beyond the small-α behavior of powers. The paper's framing as an extension of polygamy inequalities, and its invocation of the authors' own prior result, overstate the role of known monogamy constraints. However, the mathematical claims are sound; the issue is with significance and clarity, not correctness. The reader's CONDITIONAL verdict is appropriate; an ACCEPT would overstate novelty. I see no reason to change the verdict.","tokens_in":8396,"tokens_out":12082,"duration_ms":109421,"concrete_test":"Re-prove Theorem 2 without invoking the CKW monogamy inequality: for any n-qubit state with at least two nonzero C(ρABi), if f(2)=sum C^2(ABi)>1, set α0=2; otherwise apply the paper's IVT argument. Since the same proof works identically for any function M∈[0,1] with at least two positive M(ρABi), the test confirms the result is generic. Then search for a family of states (e.g., small t in the Example 1 mixture) where α0 approaches 0, demonstrating no state-independent extension.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Analysis of the proof of Theorem 2 shows the monogamy inequality f(2)≤C^2(A|B...) is not load-bearing. The conclusion only requires: (i) f(0)≥2 from the two nonzero C(ρABi); (ii) f decreasing and continuous; (iii) LHS C^α(A|B...)≤1 for all α. If f(2)>1, the same conclusion holds with α0=2 and no crossing; if f(2)≤1, the crossing argument gives α0. Thus the existence of a positive α0 follows solely from continuity and normalization, for any measure bounded by 1. The theorem therefore does not use the physics of concurrence or EoF beyond 0≤M≤1, and the imported E^√2 monogamy result (Ref [14]) is unnecessary for the central claim. The genuine weakness is that the 'polygamy inequality' is a normalization artifact: it holds for α up to a state-dependent α0 that may be arbitrarily small, and no lower bound is given. The paper should state that the result is a continuity corollary with no universal exponent, and should either bound α0 or weaken the title's claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":8684,"tokens_out":9078,"duration_ms":82400,"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":[{"comment":"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.","section":"Sec. II, Theorem 2 and Sec. III, Theorem 3"},{"comment":"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.","section":"Sec. II, Example 1 and Sec. III, Theorem 3"}],"minor_comments":[{"comment":"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.","section":"Sec. II, Theorem 1"},{"comment":"The expression 'CABCAC' appears to be a typo; it should read C(ρ_AB)C(ρ_AC).","section":"Sec. II, after Theorem 1"},{"comment":"The text says 'see Fig. 3' when referring to the EoF example, but the correct figure is Fig. 4.","section":"Sec. III, Example 3"},{"comment":"References [14] and [15] contain duplicated titles ('Entanglement monogamy relations of qubit systems' appears twice).","section":"References"},{"comment":"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.","section":"Sec. III, Eq. (12)"}],"recommendation":"major_revision","confidential_remarks":"The paper is technically correct but very limited in scope; the main theorem is essentially a continuity argument that applies to any normalized entanglement measure. The editors may wish to weigh whether the current framing meets the journal's novelty standards. I recommend asking the authors to either provide a nontrivial lower bound on α0 or to reframe the paper as a general observation about normalized entanglement measures, with the qubit results as corollaries."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the theorems are true, but the proof reveals the result is mostly a normalization artifact. For any measure with values in [0,1] and at least two nonzero reduced terms, f(α)=Σ M_i^α starts at ≥2 at α=0, decreases continuously, while the left-hand side M_{A|rest}^α ≤1. So a state-dependent threshold always exists. The CKW and E^{√2} monogamy bounds are not load-bearing; their only role is to guarantee the crossing happens before α=2 (or √2), and even that is unnecessary if you allow α0=2.\n\nCredit where due: the proofs are valid, the examples are concrete, and the literal statement that a positive α0 exists for C^α and E^α polygamy is not in the cited literature. The paper is honest about not providing a universal exponent.\n\nSoft spots: the contribution is thin. No lower bound on α0 is given, so the result may hold only on an arbitrarily small interval. The title 'Polygamy Inequalities' overstates: there is no fixed exponent region, just a state-dependent one. The paper should say plainly that the inequality follows from normalization plus continuity, not from the physics of concurrence or EoF. The EoF part imports the authors' own monogamy result from Ref. [14]; that is not circular, but it is unnecessary. Minor issues: the notation 2⊗2⊗2^{n-2} for a tripartite state is confusing, there is a 'CABCAC' typo, and figure references are mislabeled (Example 3 refers to Fig. 3, which belongs to Example 2).\n\nWho it is for: people tracking polygamy inequalities might want this on record, but it will not change how anyone thinks about entanglement distribution. I would not cite it in my own work. It does deserve a serious referee—the math is checkable and the area is active—but any referee should push for a rewritten abstract that does not imply a universal exponent.","headline":"Correct but near-tautological: the polygamy threshold is a normalization artifact, and the result is thinner than the title suggests.","tokens_in":9226,"tokens_out":5082,"would_cite":false,"duration_ms":42764,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P40"],"pacs":[],"model":"deepseek-v4-flash","headline":"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]).","keywords":["polygamy inequality","monogamy of entanglement","concurrence","entanglement of formation","n-qubit states","entanglement of assistance"],"falsifier":"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.","tokens_in":8187,"feed_emoji":"🔗","tokens_out":19916,"duration_ms":177515,"temperature":0.7,"pith_summary":"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.","feed_headline":"A cutoff exponent extends entanglement polygamy to all n-qubit states","feed_subtitle":"For any qubit state with two entangled reduced pairs, the bound holds for every power up to a state-dependent cutoff.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Gives the general monogamy inequality for squared concurrence used to conclude f(2)≤1 in Theorem 2.","marker":"[10]"},{"why":"Supports the same squared-concurrence monogamy bound for n-qubit states, joining [10] in the step that bounds f(2).","marker":"[11]"},{"why":"The earlier work whose negative-power polygamy results are extended, and the source of the E^{√2} monogamy bound used in Theorem 3.","marker":"[14]"}],"fun_headline_variants":["Qubit polygamy extends to all powers up to a cutoff","All n-qubit states obey polygamy for powers up to α0","Positive-alpha polygamy proven for any qubit system","Cutoff exponent broadens entanglement polygamy to all qubits","From zero to α0: qubit polygamy bounds expand"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Qubit polygamy extends to all powers up to a cutoff","All n-qubit states obey polygamy for powers up to α0","Positive-alpha polygamy proven for any qubit system","Cutoff exponent broadens entanglement polygamy to all qubits","From zero to α0: qubit polygamy bounds expand"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000643,"raw_usage":{"total_tokens":2903,"prompt_tokens":840,"completion_tokens":2063,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":456,"completion_tokens_details":{"reasoning_tokens":1971}},"tokens_in":456,"tokens_out":2063,"duration_ms":14932,"temperature":1.0,"reasoning_tokens":1971,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:05:44.497658+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the general monogamy inequality for squared concurrence used to conclude f(2)≤1 in Theorem 2."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supports the same squared-concurrence monogamy bound for n-qubit states, joining [10] in the step that bounds f(2)."},{"cited_title":"Guo, Any entanglement of assistance is polygamous, Qu antum Information Processing (2018) 17:222","cited_arxiv_id":null,"evidence_quote":"The earlier work whose negative-power polygamy results are extended, and the source of the E^{√2} monogamy bound used in Theorem 3."}],"review_version":1}