{"id":"185ee015-4094-43f6-a4b2-51b7c4a28fed","arxiv_id":"2608.11406","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"New multipartite Rains-type entanglement measures are defined, with one-shot and asymptotic pure-state distillation bounds proven in terms of them.","lead":"The paper defines four new multipartite entanglement measures that generalize the bipartite Rains relative entropy and proves upper bounds on how fast an arbitrary state can be distilled into a fixed pure state. The one-shot bound is tightest in terms of the Rains entanglement, while asymptotic bounds use the new hurricane and squall measures.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified; the Proposition 6 minimax/compactness gap is not load-bearing because Theorems 22 and 23 do not depend on it.","rationale":"The reader's ACCEPT with moderate confidence is sound. The weakest assumption they identified, the compactness of T(H_k) in Proposition 6, is a genuine omission in presentation but not a correctness risk: the set is obviously compact in finite dimension, and more importantly Proposition 6 is not used in the proofs of Theorem 22 or Theorem 23. The central one-shot distillability bound rests on Theorem 11 (selective PPT monotonicity) and Lemma 16, both of which I traced in detail and found internally consistent. The asymptotic bound in Theorem 23 relies on tensor-power subadditivity of the hurricane entanglement and on interchanging two infima, which is trivially valid and does not need the Mosonyi-Hiai minimax theorem. Minor typographical issues and the H_min=0 domain edge case do not affect the main results, which target GHZ and W states with positive H_min. Therefore the reader's verdict should remain unchanged.","tokens_in":39674,"tokens_out":34541,"duration_ms":284605,"concrete_test":"Add a one-paragraph proof that T(H_k) from (33) is compact (closed and bounded under the trace-norm constraint and PSD constraints) and rerun the minimax step in Proposition 6 with this explicit justification; this settles the only flagged gap without changing any theorem. Independently, re-derive the branch of the proof of Theorem 22 that uses Lemma 16, confirming the lower bound on R(eψ_ℓ) uses H_min(ψ^{⊗ℓ}) = ℓ H_min(ψ) and that the fidelity condition is satisfied.","verdict_should_be":"UNCHANGED","load_bearing_attack":"After a careful review of the central proofs, I find no load-bearing gap in the main claims. The reader's flagged concern about Proposition 6 is real but not load-bearing: Theorem 22 (the one-shot Rains bound) never invokes Proposition 6, and Theorem 23 (the asymptotic hurricane bound) only interchanges two infima for the hurricane entanglement, which requires no compactness or minimax theorem. Moreover, the asserted compactness of T(H_k) in (33) is immediate: it is a closed, bounded subset of finite-dimensional Hermitian space, since the trace-norm constraint and PSD constraints are closed and ||T_m(τ_m)||_1 ≥ Tr[τ_m] bounds the trace. The main chain in Theorem 22 uses selective PPT monotonicity (Theorem 11) and Lemma 16; I checked the algebra, including the logarithmic concavity step and the branch handling of q^ℓ, and found it consistent. Minor issues exist: the statement of Theorem 22 divides by H_min(ψ), which vanishes for product targets, and the proof of Lemma 16's squall part writes F ≥ max_m ||T_m(ψ)||_∞ where the condition should be F ≥ min_m ||T_m(ψ)||_∞. These are correctable and do not affect the GHZ/W applications, where H_min is positive. The Ising application lacks shipped code/data, but this does not bear on the theoretical central claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces four multipartite generalizations of the bipartite Rains relative entropy—the Rains, monsoon, hurricane, and squall entanglement—and studies their properties. It proves an ordering among the measures, monotonicity under PPT operations, selective PPT monotonicity of Rains entanglement, tensor-power and tensor-product subadditivity of hurricane and squall entanglement, and exact Rains values for GHZ and W states. The central results are Theorems 22 and 23, which give single-letter upper bounds on one-shot and asymptotic pure-state distillation rates in terms of Rains and hurricane/squall entanglement, with corollaries for GHZ- and W-distillable entanglement. The paper also formulates the max-Rains entanglement as an SDP with a dual program, evaluates all measures on quantum pairwise independent networks (min-cut and max-cut), and compares the measures in the one-dimensional transverse-field Ising model.","tokens_in":39960,"tokens_out":13669,"duration_ms":128427,"significance":"The main theoretical contribution is a coherent family of multipartite Rains-type measures with an operational one-shot upper bound stated in terms of the smallest measure. If correct, Theorem 22 gives the tightest single-letter Rains-type upper bound for one-shot multipartite pure-state distillation, and Theorem 23 provides single-letter asymptotic bounds via hurricane and squall entanglement. The proofs are mostly self-contained and use standard tools such as data processing, minimax arguments, and SDP duality. The GHZ and W formulas are exact, and the qPIN min-cut/max-cut results are clean and checkable. The paper does not fit parameters to data, and the derivations show no circularity. The Ising comparison is illustrative rather than load-bearing for the main claims.","major_comments":[],"minor_comments":[{"comment":"As stated, H_min(psi) in (120) vanishes when psi is product across at least one bipartition, so the right-hand sides of (216) and (217) are undefined. Please add the hypothesis H_min(psi) > 0 or explicitly define the right-hand side to be +infinity in the product case; the intended applications to GHZ and W states already have positive H_min.","section":"Theorem 22 (Section VI-A)"},{"comment":"In the squall part of the proof, after Eq. (159) the text says 'assume F >= max_m ||T_m(psi)||_infinity', but the statement in (128) and the calculation that follows require F >= min_m ||T_m(psi)||_infinity. This is a typo, but it should be corrected because the displayed assumption contradicts the condition being used.","section":"Lemma 16 (Section V-A)"},{"comment":"The proof of the left limit in (45) invokes compactness of T(H_k) and the Mosonyi-Hiai minimax theorem, asserting lower semi-continuity and compactness rather than proving them. The same minimax step appears in Proposition 30 at (277). This is a gap in a secondary result: Theorem 23 does not rely on Proposition 6, and the compactness of T(H_k) is in fact immediate from (33), but a sentence with the argument or a precise citation would make the proof complete.","section":"Proposition 6 (Section III)"},{"comment":"These corollaries say 'Recall from (261)' even though Eq. (261) is defined only later in Section VI-C for GHZ distillation. Please renumber or move the displayed inequalities so that the cross-reference is forward-consistent.","section":"Corollaries 25 and 26 (Section VI-B)"},{"comment":"The symbols for H_min(psi) and Hmin(psi) in (120)-(122) differ only by an underline/overline, which is easy to lose in plain text or after typesetting compression. Please use more visually distinct notation, since Lemma 16 and its applications depend on which quantity is meant.","section":"Notation (Section V-A)"},{"comment":"Figure 4 is said to be produced using existing packages, but no data or code repository is provided, and Appendix E presents algorithms without numerical demonstrations. For reproducibility, please state whether the Ising data and the Frank-Wolfe implementation will be made available.","section":"Section IX and Appendix E"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper is worth taking seriously. It defines three new multipartite entanglement measures — monsoon, hurricane, squall — alongside the multipartite Rains entanglement, proves an ordering among them, and establishes the main technical result: single-letter upper bounds on one-shot and asymptotic pure-state distillation rates. The one-shot bound in terms of Rains entanglement is the tightest of the four and looks correct. The asymptotic bound in terms of hurricane entanglement is genuinely new and, as far as I can tell, the first of its kind for arbitrary target states. The corollaries for GHZ and W states are clean and explicit.\n\nWhat the paper does well: the proofs are detailed and mostly self-contained. The selective PPT monotonicity proof (Theorem 11) is intricate but checks out. The SDP for max-Rains with a rigorous dual is a nice piece of work, and the qPIN results — R, monsoon, and hurricane all equal the min cut, squall equals the max cut — are elegant and make the measures concrete.\n\nThe reader’s concern about Proposition 6 is legitimate but not load-bearing. The proof of the α→1 limit invokes the Mosonyi–Hiai minimax theorem and asserts compactness of T(H_k) without proving it. Compactness is actually immediate here: T(H_k) is a closed, bounded subset of finite-dimensional Hermitian space, so the gap is easily patched. More importantly, Theorem 22 never uses Proposition 6, and Theorem 23 only uses the hurricane version, where the limit interchange is trivial. So the central distillation bounds stand on independent grounds.\n\nTwo minor issues worth flagging. Theorem 22 divides by H_min(ψ), which vanishes for product target states; the bound is then vacuous rather than false, but the statement should say the interesting case is entangled targets. Also, in the proof of Lemma 16, the squall part writes the condition as F ≥ max_m ||T_m(ψ)||_∞ when it should be min_m; that is a typo, and the statement of the lemma already has the correct condition. Neither affects the GHZ/W applications.\n\nThe Ising model section lacks shipped code and data, which weakens reproducibility, but that is peripheral to the theoretical claims. The citation pattern is fair; the authors build on their own earlier Rains definition but do not hide it, and the new results go well beyond it.\n\nWho is this for? Quantum information theorists working on entanglement measures and distillation. The paper deserves a serious referee. I would send it to review and expect acceptance after minor revisions.","headline":"A solid, well-written theory paper that delivers new multipartite entanglement measures and credible single-letter distillation bounds; the one soft spot flagged by the reader's report is real but not load-bearing.","tokens_in":40459,"tokens_out":1597,"would_cite":true,"duration_ms":20474,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P45","81P40","90C22"],"pacs":["03.67.Mn"],"model":"deepseek-v4-flash","headline":"Multipartite Rains entanglement sets a single-letter cap on pure-state distillation","keywords":["multipartite entanglement","Rains entanglement","entanglement distillation","genuine multipartite entanglement","PPT operations","semidefinite programming","quantum networks","one-shot bounds"],"falsifier":"A direct test of the central claim is to search small dimensions for a $k$-partite state $\\rho$, a pure target $\\psi$, and an explicit LOCC protocol whose success-probability-weighted output rate $p\\ell$ exceeds $(R(\\rho)+h_2(\\varepsilon))/((1-\\varepsilon)H_{\\min}(\\psi))$; any such protocol would refute Theorem 22. A cheaper numerical test is to compute $R(\\rho)$ by the SDP of Lemma 5 and compare it with $\\lim_{\\alpha\\to1}\\widetilde{R}_\\alpha(\\rho)$ for a random state, since Proposition 6 is the gateway to the bound.","tokens_in":39520,"feed_emoji":"🌊","tokens_out":6978,"duration_ms":58254,"temperature":0.7,"pith_summary":"This paper generalizes the bipartite Rains relative entropy—the tightest known computable upper bound on distillable entanglement—to multipartite systems, producing four ordered measures (Rains, monsoon, hurricane, squall) that detect different grades of multipartite entanglement. Its central result is a one-shot bound: for any $k$-partite state $\\rho$ and any pure target $\\psi$, the probabilistic approximate distillable-$\\psi$ satisfies $E_{\\mathrm{PD}}^{(\\varepsilon,\\psi)}(\\rho) \\leq (R(\\rho)+h_2(\\varepsilon))/((1-\\varepsilon) H_{\\min}(\\psi))$, where $R$ is the new multipartite Rains entanglement and $H_{\\min}$ is the minimum min-entropy over bipartitions. This matters because multipartite entanglement manipulation is not asymptotically reversible, so bounding distillation to a fixed Bell state does not cover all targets; a bound for arbitrary pure targets is needed. The paper also proves an asymptotic strong-converse bound in terms of the hurricane and squall entanglement, evaluates the Rains entanglement exactly for GHZ and W states, and provides SDP formulations plus a Frank-Wolfe algorithm.","feed_headline":"New Rains bound caps how fast any pure state can be distilled","feed_subtitle":"Ordered multipartite measures set a computable ceiling on how fast any pure state can be distilled.","key_machinery":"The load-bearing object is the feasible set $T(H)$ of Lemma 5: operators $\\tau=\\sum_m \\tau_m$ with $\\tau_m\\geq0$ and $\\sum_m \\|T_m(\\tau_m)\\|_1\\leq1$ over bipartitions $m$, which lets $R(\\rho)$ be a single infimum of relative entropy instead of a mixed convex roof. The proof of the one-shot bound combines selective PPT monotonicity (Theorem 11) with a binary measurement channel $M_\\psi(\\cdot)=\\mathrm{Tr}[\\psi(\\cdot)]|1\\rangle\\langle1|+\\mathrm{Tr}[(1-\\psi)(\\cdot)]|0\\rangle\\langle0|$, reducing the problem to a classical relative-entropy comparison whose threshold is $\\max_m \\|T_m(\\psi)\\|_\\infty=2^{-H_{\\min}(\\psi)}$. The hurricane entanglement $R_H$ is the minimum over bipartitions of the bipartite Rains relative entropy; its tensor-power subadditivity is what allows the asymptotic bound.","core_discovery":"The paper establishes that among its four multipartite generalizations of the Rains relative entropy, the smallest one—the Rains entanglement $R(\\rho)=\\inf_{\\tau\\in T(H)} D(\\rho\\|\\tau)$ with $T(H)$ the set of positive partial-transpose mixtures—gives the tightest one-shot obstruction to converting a state into any fixed pure state by LOCC. In Theorem 22 it proves that the one-shot probabilistic approximate distillable-$\\psi$ is no larger than $(R(\\rho)+h_2(\\varepsilon))/((1-\\varepsilon)H_{\\min}(\\psi))$. The proof runs through two mechanisms: selective monotonicity of $R$ under completely PPT-preserving operations, and a measurement channel that projects the fidelity against $\\psi$ onto a binary classical relative entropy. In the asymptotic setting the same one-shot bound cannot be directly tensorized because biseparability is tensor unstable (activation of GME), so the paper proves instead that the strong-converse rate is no larger than $R_H(\\rho)/H_{\\min}(\\psi)\\leq R_S(\\rho)/H_{\\min}(\\psi)$, where $R_H$ and $R_S$ are the hurricane and squall entanglements.","pith_inferences":["If the minimax obstruction in Proposition 6 could be bypassed by proving tensor-power subadditivity of $R$, the asymptotic bound would likely tighten from hurricane to Rains; the paper's identification of activation of GME as the obstacle suggests testing $R(\\rho^{\\otimes2})$ against $2R(\\rho)$ on states close to biseparable mixtures.","The sharp separation among measures in the transverse-field Ising model suggests a testable extension: use $R$ as a finite-size-scaling probe of quantum criticality and compare its behavior with log-negativity in two- and three-dimensional models.","The min-cut/max-cut dichotomy for qPINs implies an algorithmic-hardness warning: the squall entanglement can be NP-hard to compute on networks, while the Rains measure is easy, so computational tractability tracks how many bipartitions the measure checks simultaneously."],"forward_implications":["For any fixed pure target, the one-shot upper bound is computable by semidefinite programming, so the rate at which a given multipartite state can be converted to GHZ, W, or any other pure state can be certified without optimizing over protocols.","The exact values $R(\\Phi_k^d)=\\log_2 d$ and $R(W_k)=\\log_2(k/(k-1))$ turn the general bounds into explicit single-letter caps on GHZ- and W-distillation: $\\widetilde E_{\\mathrm{PD}}(\\rho)\\leq R_H(\\rho)$ for GHZ targets and $\\leq R_H(\\rho)/\\log_2(k/(k-1))$ for W targets.","On quantum pairwise independent networks, $R=R_M=R_H$ equals the minimum cut of the underlying multigraph and $R_S$ equals the maximum cut; this makes the Rains bound polynomial-time computable and tight for some networks where tree packing is optimal.","The dual SDP for the max-Rains entanglement shows it never exceeds the genuine multipartite log-negativity, giving a cheaper upper bound for distillation when relative-entropy optimization is too costly."],"supporting_citations":[{"why":"Earlier paper introducing genuine multipartite Rains entanglement, whose terminology and Lemma 14 the present proofs reuse.","marker":"[1]"},{"why":"Rains' original semidefinite program for bipartite distillable entanglement, the quantity being generalized.","marker":"[7]"},{"why":"Establishes the formula $R(\\rho)=\\inf_{\\sigma\\in\\mathrm{PPT}'}D(\\rho\\|\\sigma)$ and the pure-state equality used for GHZ and W bounds.","marker":"[8]"},{"why":"Supplies monotonicity and direct-sum properties of sandwiched Rényi relative entropy used in the one-shot bound and Theorem 11.","marker":"[31]"},{"why":"Provides the proof template and inequality behind selective PPT monotonicity of the Rains entanglement.","marker":"[32]"},{"why":"Mosonyi–Hiai minimax theorem used in Proposition 6 to interchange infimum and $\\alpha\\to1$ limit.","marker":"[42]"}],"fun_headline_variants":["Rains entanglement caps one-shot pure-state distillation rate","Monsoon, hurricane, squall join Rains as multipartite entanglement measures","Max-Rains entanglement is a semidefinite program with dual","Activation blocks Rains asymptote; hurricane and squall provide bounds"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Everything downstream of Proposition 6 assumes that the minimax interchange $\\inf_{\\tau\\in T(H_k)}\\lim_{\\alpha\\to1}$ is valid, which requires $T(H_k)$ to be compact and the sandwiched Rényi relative entropy to be lower semicontinuous in $\\tau$; the paper asserts compactness without an explicit proof.","fun_headline_variants_meta":{"raw":{"variants":["Rains entanglement caps one-shot pure-state distillation rate","Monsoon, hurricane, squall join Rains as multipartite entanglement measures","Max-Rains entanglement is a semidefinite program with dual","Activation blocks Rains asymptote; hurricane and squall provide bounds"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000978,"raw_usage":{"total_tokens":4223,"prompt_tokens":1082,"completion_tokens":3141,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":698,"completion_tokens_details":{"reasoning_tokens":3066}},"tokens_in":698,"tokens_out":3141,"duration_ms":22834,"temperature":1.0,"reasoning_tokens":3066,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T14:12:47.238112+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct test of the central claim is to search small dimensions for a $k$-partite state $\\rho$, a pure target $\\psi$, and an explicit LOCC protocol whose success-probability-weighted output rate $p\\ell$ exceeds $(R(\\rho)+h_2(\\varepsilon))/((1-\\varepsilon)H_{\\min}(\\psi))$; any such protocol would refute Theorem 22. A cheaper numerical test is to compute $R(\\rho)$ by the SDP of Lemma 5 and compare it with $\\lim_{\\alpha\\to1}\\widetilde{R}_\\alpha(\\rho)$ for a random state, since Proposition 6 is the gateway to the bound.","supporting_citations":[{"cited_title":"Genuine multipartite Rains entanglement,","cited_arxiv_id":null,"evidence_quote":"Earlier paper introducing genuine multipartite Rains entanglement, whose terminology and Lemma 14 the present proofs reuse."},{"cited_title":"Asymptotic relative entropy of entanglement for orthogonally invariant states,","cited_arxiv_id":null,"evidence_quote":"Establishes the formula $R(\\rho)=\\inf_{\\sigma\\in\\mathrm{PPT}'}D(\\rho\\|\\sigma)$ and the pure-state equality used for GHZ and W bounds."},{"cited_title":"Khatri, L","cited_arxiv_id":null,"evidence_quote":"Supplies monotonicity and direct-sum properties of sandwiched Rényi relative entropy used in the one-shot bound and Theorem 11."},{"cited_title":"On the quantum R ´enyi relative entropies and related capacity formulas,","cited_arxiv_id":null,"evidence_quote":"Mosonyi–Hiai minimax theorem used in Proposition 6 to interchange infimum and $\\alpha\\to1$ limit."}],"review_version":1}