{"id":"ef33e879-d4cf-4b95-b5ca-613db6b96b82","arxiv_id":"2608.09832","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The purity of any absolutely PPT bipartite state in dimension m by n is bounded above by a piecewise formula near 4/(3mn), tight for qubit-qudit systems when mn is at least 8.","lead":"A short proof shows that any bipartite quantum state which stays positive under partial transpose under every global rotation has purity at most about 4 divided by three times the product of the subsystem dimensions. For qubit-qudit systems this bound is exactly the largest possible purity, matching known exact results.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1 is false as stated for one-dimensional subsystems: when m=1 (or n=1), every state is APPT and a pure state has purity 1, violating the claimed bound; adding m,n≥2 repairs the theorem.","rationale":"The reader's weakest_assumption identifies exactly the same load-bearing gap: Hildebrand's necessary condition is used without the nontrivial-bipartite-system hypothesis m,n≥2. This is not a mere technicality. For m=1, every state is APPT, so a pure state has purity 1 and violates the claimed bound. The theorem as stated is therefore false. The repair is simple: state m,n≥2. With that hypothesis, the proof appears sound: S_k is a valid superset of APPT spectra, the vertex enumeration in Lemma 2.1 is correct for a simplex cut by one linear inequality, and the type-3 maximizers achieve equality in the stronger Hildebrand inequality, which explains why the bound is tight for qubit-qudit systems. The abstract's unqualified claim about qubit-qudit maxima should also carry the mn≥8 qualifier, since for two-qubit systems the bound formula would give 1/3 whereas the true maximum is 3/8. No further substantive defect is apparent, so the verdict remains conditional on the repaired statement.","tokens_in":7062,"tokens_out":19629,"duration_ms":167186,"concrete_test":"Set m=1, n=8 and take ρ=|0⟩⟨0| on H_A⊗H_B = C^1⊗C^8. Verify that ρ is APPT (partial transposition is trivial or preserves positivity), that Tr(ρ^2)=1, and that Theorem 1 with k=8 gives 4/(3·8)=1/6. The contradiction confirms that the missing hypothesis m,n≥2 is load-bearing.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The proof's only link from APPT to the optimization problem is the inequality λ1 ≤ λ_{mn−1} + 2√(λ_{mn−2}λ_{mn}) attributed to Hildebrand in Section 1. That inequality is a necessary condition for APPT spectra only when both local dimensions are at least 2. Theorem 1 states only mn≥8, so it permits m=1 or n=1. In those cases every state is APPT: partial transposition on a one-dimensional subsystem is trivial, and transposition of a positive semidefinite matrix preserves positivity. A pure state then has purity 1. For example, with m=1,n=8, the claimed bound is 4/(3·8)=1/6, so the theorem as stated is false. The same failure occurs for any k=mn≥8 because the pure state spectrum (1,0,…,0) violates the Hildebrand inequality (1 ≤ 0). Adding m,n≥2 fixes the statement; the abstract's claim about qubit-qudit maxima also needs the mn≥8 qualifier, although Theorem 1 itself includes it. The rest of the proof—vertex enumeration of S_k and convex maximization—appears internally consistent, and the type-3 maximizers satisfy the stronger Hildebrand inequality with equality, so the intended result for nontrivial bipartite systems is credible.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper gives an upper bound for the purity Tr(ρ²) of bipartite absolutely positive partial transpose (APPT) states in terms of the total dimension k=mn. The proof translates the APPT spectral condition into the relaxed eigenvalue inequality λ₁ ≤ λ_{k−2}+λ_{k−1}+λ_k, defines the polytope S_k of ordered spectra satisfying this inequality, enumerates its vertices, and maximizes the strictly convex purity functional over S_k. The resulting closed-form bound for k≥8 depends on k modulo 4 and matches the known qubit-qudit maximal purity results of Song and Chen for the covered range. The argument is transparent and self-contained apart from Hildebrand's necessary condition and standard convex analysis.","tokens_in":7291,"tokens_out":12905,"duration_ms":111346,"significance":"If the missing domain hypothesis is repaired, the result is a useful, clean improvement over the general purity bound 2/(mn) for absolutely separable states: for example, the new bound is 1/6 for k=8 and 1/9 for k=12, compared with 1/4 and 1/6 from the earlier bound. It also confirms the qutrit-qudit conjecture of Dũng and Khoi as an upper bound. The proof has genuine strengths: it reduces a quantum-information problem to a small, explicit vertex-enumeration problem, the polytope computation is transparent and checkable, and the type-3 maximizing spectra satisfy Hildebrand's stronger inequality with equality, so the bound is tight for nontrivial bipartite systems in the covered range.","major_comments":[{"comment":"Theorem 1 is stated for mn≥8 without requiring m,n≥2. This is false as stated: for m=1 (or n=1), every state is APPT because partial transposition on a one-dimensional subsystem is trivial, and a pure one-qudit state has purity 1, which exceeds the claimed bound (for k=8 the claimed bound is 1/6). The proof in Section 2 uses Hildebrand's inequality λ₁ ≤ λ_{mn−1} + 2√(λ_{mn−2}λ_{mn}), which is a necessary condition for APPT spectra only when both local dimensions are at least 2. The statement should explicitly assume dim H_A, dim H_B ≥ 2 (equivalently m,n ≥ 2); with this additional hypothesis the upper-bound argument goes through.","section":"Theorem 1, Section 1"}],"minor_comments":[{"comment":"The sentence 'For qubit-qudit systems, this upper bound becomes the maximum purity of APPT (and absolutely separable) states' should be qualified by the theorem's condition mn≥8; otherwise the two-qubit case (mn=4, true maximum 3/8) and the qubit-qutrit case (mn=6) are not covered by the theorem as stated.","section":"Abstract and Section 1"},{"comment":"For k=8, the maximum over S_8 is also attained at the type-1 vertex (1/6,...,1/6,0,0), which does not satisfy Hildebrand's stronger inequality. This does not affect the upper-bound argument because the type-3 vertex achieves the same value, but a short remark clarifying that only the type-3 maximizer is APPT-admissible would prevent confusion.","section":"Theorem 2.2, k=8"},{"comment":"The proof uses the fact that every segment between two vertices of T_k is an edge; this is true because T_k is a simplex, but the claim is not stated or justified. A one-sentence explanation would make the vertex enumeration fully self-contained.","section":"Lemma 2.1"},{"comment":"The comparisons such as M₃ > M₂ for k≥12, k≥9, etc., are asserted without derivation. The inequalities are plausible and can be verified algebraically, but adding a short verification or an appendix would strengthen the paper.","section":"Proof of Theorem 2.2"},{"comment":"Reference [1] contains a typographical error in the author name: 'D˜ ung' should be 'Dũng'.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The only substantive issue is the missing m,n≥2 hypothesis in Theorem 1; this is a simple statement-level fix and does not affect the proof strategy. After the repair, the note is a concise, correct contribution suitable for a quantum-information journal. I recommend major revision rather than rejection because the central claim is defensible and the required change is local."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take. The main theorem is a genuine advance: a dimension-dependent upper bound on the purity of APPT (and hence absolutely separable) states, improving the previous general 2/(mn) bound to roughly 4/(3mn), and proving the qutrit-qudit conjecture from [1] as a special case. The proof is pleasingly direct: use Hildebrand's spectral necessary condition, drop the square-root to a linear inequality, then maximize the convex purity function over the resulting polytope by enumerating vertices. No fitting, no circular dependence on the conjecture it proves. The vertex enumeration and the case check are easy to follow, and the stated maximizers do satisfy Hildebrand's stronger condition with equality, which is good evidence the intended result is correct.\n\nThe soft spot is in the statement, not the argument. Theorem 1 says 'mn≥8' but does not require m,n≥2. For m=1 or n=1 every state is APPT, and a pure state has purity 1, which violates the bound. The proof silently assumes the nontrivial bipartite setting because Hildebrand's inequality is only valid there. This is a one-line fix: add m,n≥2 to Theorem 1. It is not a subtle flaw; it is the kind of domain error that should have been caught before submission, but it does not touch the intended result.\n\nThere is a smaller overstatement in the abstract: it says for qubit-qudit systems the upper bound 'becomes the maximum purity.' That is true only for mn≥8. For two-qubit (mn=4) the known maximum is 3/8, which is not the formula. The body of Theorem 1 has the mn≥8 qualifier, so just align the abstract.\n\nAlso, the proof compares M2 and M3 with a few '>' claims without showing the algebra. I checked a couple and they hold; a referee might ask for a one-line justification, but it's not a defect.\n\nVerdict: solid and useful for the entanglement community. It deserves a serious referee and a quick revision. I'd cite it for the new bound. This is a conditional accept, not a reject.","headline":"A clean convex-geometry proof of a new APPT purity bound that needs a one-line domain fix (m,n≥2) and a more careful abstract, but is otherwise solid and worth refereeing.","tokens_in":7876,"tokens_out":2411,"would_cite":true,"duration_ms":21739,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P42"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every APPT state on $m\\otimes n$ with $mn\\ge8$, the purity is bounded by a piecewise formula in $mn\\bmod 4$, and the bound is sharp for qubit-qudit systems.","keywords":["absolutely separable state","absolutely positive partial transpose state","purity","bipartite quantum state","spectral polytope","qubit-qudit systems","convex vertex maximization"],"falsifier":"Take $m=1$, $n\\ge8$, and any pure state on $\\mathbb{C}^1\\otimes\\mathbb{C}^n$: it is APPT with purity $1$, while the theorem's formula is $<1$, so the printed statement is false. For the intended $m,n\\ge2$ version, search the $2\\times4$ system numerically for APPT states with purity above $1/6$; the theorem predicts none, and the spectrum $(1/4,1/4,1/12,\\ldots,1/12)$ attains $1/6$.","tokens_in":6820,"feed_emoji":"⚛️","tokens_out":12011,"duration_ms":97977,"temperature":0.7,"pith_summary":"An absolutely positive partial transpose (APPT) state is a bipartite quantum state whose partial transpose remains positive under every global unitary, and every absolutely separable state is APPT. The paper proves that for any APPT state on $\\mathbb{C}^m\\otimes\\mathbb{C}^n$ with $mn\\ge 8$, the purity is at most $4/(3mn)$ when $mn\\equiv0\\pmod4$, $4(3mn-2)/(3mn-1)^2$ when $mn\\equiv1\\pmod4$, $4(3mn+4)/(3mn+2)^2$ when $mn\\equiv2\\pmod4$, and $4(3mn+2)/(3mn+1)^2$ when $mn\\equiv3\\pmod4$. Because every absolutely separable state is APPT, this ceiling also applies to absolutely separable states and improves the known general bound. For qubit-qudit systems, where the two classes coincide, the bound is attained and therefore gives the maximum purity. The statement as printed omits the hypothesis $m,n\\ge2$; with $m=1$ a pure state is APPT and has purity $1$, so the theorem requires that repair to be correct.","feed_headline":"Purity capped near 4/(3mn) for APPT states","feed_subtitle":"The ceiling depends only on the product of the subsystem dimensions and is tight for qubit-qudit systems.","key_machinery":"The working object is the convex polytope $S_k$ of ordered spectra $\\lambda_1\\ge\\cdots\\ge\\lambda_k\\ge0$ with $\\sum_i\\lambda_i=1$ and $\\lambda_1\\le\\lambda_{k-2}+\\lambda_{k-1}+\\lambda_k$. It is obtained from the APPT necessary inequality $\\lambda_1\\le\\lambda_{k-1}+2\\sqrt{\\lambda_{k-2}\\lambda_k}$ by replacing $2\\sqrt{ab}$ with $a+b$. Since the purity $F(\\lambda)=\\sum_i\\lambda_i^2$ is strictly convex and $S_k$ is compact, the maximum is attained at a vertex; Lemma 2.1 lists all vertices as belonging to three types, and Theorem 2.2 evaluates $F$ at each type. This reduces a spectral optimization over continuous spectra to a finite comparison of rational values indexed by $k$ modulo 4.","core_discovery":"The central claim, Theorem 1, is that for $mn\\ge8$ every APPT state on $\\mathbb{C}^m\\otimes\\mathbb{C}^n$ has purity at most $4/(3mn)$ when $mn\\equiv0\\pmod4$, and at most $4(3mn-2)/(3mn-1)^2$, $4(3mn+4)/(3mn+2)^2$, or $4(3mn+2)/(3mn+1)^2$ in the other three residue classes. The route is spectral: the proof keeps only the ordered eigenvalues $\\lambda_1\\ge\\cdots\\ge\\lambda_k$, the trace condition $\\sum_i\\lambda_i=1$, and the inequality $\\lambda_1\\le\\lambda_{k-2}+\\lambda_{k-1}+\\lambda_k$, which is a relaxation of a known necessary condition for APPT spectra. Maximizing $\\sum_i\\lambda_i^2$ over that polytope is the entire content of the argument, and because the objective is strictly convex the maximum is found at a vertex. The paper classifies the vertices into three families and compares the purity values, obtaining the piecewise formula. For qubit-qudit systems the bound is attained, and because absolute separability coincides with APPT there, it is the maximum purity of absolutely separable states as well.","pith_inferences":["Because the argument uses only the relaxed constraint, the same vertex classification should bound other convex spectral functions of APPT states, such as $\\sum_i\\lambda_i^p$ for $p>1$, yielding dimension-mod-4 ceilings for Rényi-type purities.","The relaxation is lossy for systems beyond qubit-qudit; the gap between the theorem's value and the true maximum could be explored by testing the classified vertices against the full APPT inequalities rather than the relaxed one.","For $k=8$ one of the two maximizing spectra in $S_8$ violates the original APPT inequality, so the attainable maximum in the $2\\times4$ case is pinned to the other spectrum; checking this explicitly for $3\\times3$ and $3\\times4$ systems would show how tight the general bound is."],"forward_implications":["For every absolutely separable state on $\\mathbb{C}^m\\otimes\\mathbb{C}^n$ with $mn\\ge8$, the same purity ceiling holds, improving the earlier general bound $2/(mn)$.","For qubit-qudit systems with $m=2$ and $n\\ge4$, the ceiling is attainable, so it gives the exact maximum purity of both APPT and absolutely separable states.","The extremal spectra are essentially two-value spectra, so any state that reaches the bound is a mixture of two uniform components on different rank supports.","For qutrit-qudit and larger systems the theorem gives an upper bound only; the exact maximum remains open, as the paper notes."],"supporting_citations":[{"why":"Supplies the necessary spectral inequality for APPT states that the proof relaxes to build the polytope $S_k$.","marker":"[3]"},{"why":"Proves that APPT and absolutely separable states coincide for qubit-qudit systems, making the bound exact there.","marker":"[4]"},{"why":"Determined the qubit-qudit maximum purity that Theorem 1 reproduces.","marker":"[8]"},{"why":"Gives the previous general purity bound $2/(mn)$ for absolutely separable states, which this result improves.","marker":"[5]"},{"why":"Provided the earlier purity bound $1/(mn-1)$ for absolute separability, the baseline the new bound refines.","marker":"[2]"},{"why":"Establishes that separable states have positive partial transpose, underlying the definition and inclusion of APPT.","marker":"[7]"}],"fun_headline_variants":["Purity ceiling for APPT states set by dimensions","Tight purity bound for APPT bipartite states","APPT purity capped: 4/(3mn) and variants","Purity max for APPT states depends only on mn","New purity bound for APPT, tight for qubit-qudit"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole proof rests on applying the known APPT spectral inequality $\\lambda_1\\le\\lambda_{k-1}+2\\sqrt{\\lambda_{k-2}\\lambda_k}$ (and its relaxation) to the state, which implicitly requires both local dimensions at least 2; the theorem as printed omits that hypothesis and is false for $m=1$.","fun_headline_variants_meta":{"raw":{"variants":["Purity ceiling for APPT states set by dimensions","Tight purity bound for APPT bipartite states","APPT purity capped: 4/(3mn) and variants","Purity max for APPT states depends only on mn","New purity bound for APPT, tight for qubit-qudit"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000275,"raw_usage":{"total_tokens":1629,"prompt_tokens":918,"completion_tokens":711,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":534,"completion_tokens_details":{"reasoning_tokens":628}},"tokens_in":534,"tokens_out":711,"duration_ms":6220,"temperature":1.0,"reasoning_tokens":628,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T05:52:42.931524+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $m=1$, $n\\ge8$, and any pure state on $\\mathbb{C}^1\\otimes\\mathbb{C}^n$: it is APPT with purity $1$, while the theorem's formula is $<1$, so the printed statement is false. For the intended $m,n\\ge2$ version, search the $2\\times4$ system numerically for APPT states with purity above $1/6$; the theorem predicts none, and the spectrum $(1/4,1/4,1/12,\\ldots,1/12)$ attains $1/6$.","supporting_citations":[{"cited_title":"Hildebrand,Positive partial transpose from spectra, Phys","cited_arxiv_id":null,"evidence_quote":"Supplies the necessary spectral inequality for APPT states that the proof relaxes to build the polytope $S_k$."},{"cited_title":"Johnston,Separability from spectrum for qubit-qudit states, Phys","cited_arxiv_id":null,"evidence_quote":"Proves that APPT and absolutely separable states coincide for qubit-qudit systems, making the bound exact there."},{"cited_title":"Song and L","cited_arxiv_id":null,"evidence_quote":"Determined the qubit-qudit maximum purity that Theorem 1 reproduces."},{"cited_title":"Gurvits and H","cited_arxiv_id":null,"evidence_quote":"Provided the earlier purity bound $1/(mn-1)$ for absolute separability, the baseline the new bound refines."},{"cited_title":"Peres,Separability criterion for density matrices, Phys","cited_arxiv_id":null,"evidence_quote":"Establishes that separable states have positive partial transpose, underlying the definition and inclusion of APPT."}],"review_version":1}