{"id":"5651efff-0f4f-49fe-a2ba-73b8d37829df","arxiv_id":"2411.12208","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For eight qubits, the maximum number of maximally mixed four-party reductions is exactly 56, and general upper and lower bounds on this number follow from Turán-type combinatorial arguments.","lead":"This paper proves that among eight-qubit pure states, at most 56 of the 70 four-party reductions can be maximally mixed, and constructs a state achieving exactly 56. It connects the general problem of maximizing maximally mixed half-body reductions to Turán's extremal problem in combinatorics, yielding bounds for all qubit numbers.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the parity-rule step in Theorem 1 is elementary and sound, and the T4 construction verifiably attains the Turán bound.","rationale":"The reader's weakest_assumption correctly identifies the parity rule as the most external premise, and the paper does cite rather than prove it. However, the rule is elementary: for Pauli products the weight parity is the parity of the symmetric difference of supports, so a product of two weight-(2m+1) operators always has even weight. In Theorem 1 the rule is applied to the sum P only through the orthogonal Pauli basis expansion of (I+P)^2, so no hidden assumption about sums enters. I independently stepped through Theorem 1, the Turán reduction, the equality condition, and the T4 counting; all are internally consistent. The lower bound m4(|T4>)=56 is supported both by the general rank-counting formula Eq. (22) and by the specific 56=70-14 decomposition in Section VI. The only reservations are presentational: the 'third known value' wording ignores trivial AME cases n=5 and n=6, and a few expressions have typos, but these do not touch the mathematical claim. Therefore the reader's ACCEPT verdict should stand unchanged.","tokens_in":18021,"tokens_out":20578,"duration_ms":216027,"concrete_test":"Write a short script that (1) symbolically expands (I+P)^2 for a generic Hermitian P containing only weight-5 Pauli terms on five qubits and checks that the odd-weight part is exactly 2P, and (2) computes the F2 rank of A_{K x \\bar K} from Eq. (16) for all 70 four-subsets K, confirming exactly 56 full-rank and 14 singular cuts with pairwise intersections at most 2. Both checks should pass; either failure would invalidate the upper or lower bound of Qex(8)=56.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I checked the central claim Qex(8)=56 in good faith. The upper bound rests on Theorem 1: if all 2m-reductions inside A=[2m+1] are maximally mixed, then rho_A=(I+P_{2m+1})/2^{2m+1} and rho_A^2=2^{1-2m}rho_A, so (I+P)^2=4(I+P). In the Pauli basis, every product of two weight-(2m+1) Pauli terms has support equal to the symmetric difference of the two supports, whose size has parity 0 mod 2; the paired sum cancels phases when the factors anticommute. Therefore P^2 contributes only even-weight terms, the odd-weight part of the identity is exactly 2P=4P, and P=0, a contradiction. This is the parity rule applied to the sum P, and it is valid because the Pauli basis is orthogonal and coefficients are real. The bound ex_4(8,K_5^4)<=56 follows from Proposition 1 with T(8,5,4)>=14. The lower bound is supplied by the graph state T4: the general rank count in Section V.B gives for k=4 exactly 2 (K=B,C) + 48 (i=1) + 6 (i=0, full rank) = 56 full-rank 4-cuts, and the 14 singular cuts pairwise intersect in at most 2 points, confirming the equality condition underlying Theorem 2. I find no load-bearing flaw. The abstract's phrase 'the third known value' is imprecise because Qex(5)=10 and Qex(6)=20 are trivial from AME existence, but this is presentational and does not affect Qex(8)=56.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the maximum number of maximally mixed half-body reductions that an n-qubit pure state can have, denoted Qex(n). The main result is the exact determination Qex(8)=56: every 8-qubit pure state has at most 56 maximally mixed 4-party reductions, and an explicit graph state |T4⟩ attains this bound, making it a 4-EME and, by Theorem 2, a PEME state. The upper bound follows from a new structural theorem (Theorem 1) showing that the hypergraph of maximally mixed 2m-party reductions of a 4m-qubit state is K^{2m}_{2m+1}-free, combined with a Turán bound. General lower bounds are obtained from explicit graph states T_k and from a probabilistic argument on random graph states. The paper also discusses the relation to maximally multipartite entangled states and shows that any state attaining the 4m-qubit upper bound must be (2m-1)-uniform.","tokens_in":18388,"tokens_out":24382,"duration_ms":219785,"significance":"If correct, Qex(8)=56 is the third nontrivial exact value of Qex(n), after Qex(4)=4 and Qex(7)=32, and it is the first value obtained by a method that does not assume the state is already (floor(n/2)-1)-uniform. The connection between quantum extremal numbers and Turán numbers is elegant and likely to be useful for further values. The proof is rigorous: the upper bound is derived from the structural theorem and a standard Turán bound, while the lower bound is supplied by an explicit graph state with a verifiable rank count. The paper also provides new families of graph states and a probabilistic lower bound that gives a constant limiting density for even n. The identification of PEME states and the discussion of their LU-inequivalence add further value. I find the central derivation sound and the contributions significant for the quantum information and combinatorics communities.","major_comments":[],"minor_comments":[{"comment":"In Eq. (19), the displayed P2 is written as I_{(k-s+1)×(k-s+1)}, but P2 is a (k-s)×(k-s) block; the correct rank-(k-s-1) form should be I_{(k-s-1)×(k-s-1)} (with appropriate zero padding). Please correct this dimension error.","section":"Eq. (19)"},{"comment":"The summation in Eq. (22) for the odd-k case is written as \"Pk i=0 C(k,s)\"; the index of summation should be s, not i, and the range should be stated consistently with the text (s=1,...,k-1, with the two boundary terms accounted for by the +2 term).","section":"Eq. (22)"},{"comment":"The claim \"It can be checked that there are 56 subsets K of four rows such that A_{K×\\bar K} has rank four\" is not tied directly to the rank analysis that follows in Section V.B. Please add an explicit count (e.g., 48 cases with i=1, 6 cases with i=2, and 2 cases K=B,C) or refer the reader to Eq. (22) with k=4.","section":"Section V.A"},{"comment":"The phrase \"the third known value for this problem\" is imprecise because Qex(5)=10 and Qex(6)=20 follow trivially from the existence of AME(5,2) and AME(6,2). Suggest \"the third nontrivial value\" or a short clarification.","section":"Abstract"},{"comment":"In the sentence discussing the 9-qubit lower bound, \"ex3(9,H4)\" should be \"ex4(9,H4)\".","section":"Section III"},{"comment":"The counting for the i=1 cases jumps from \"2 × sum_{s=ceil(k/2)}^{k-1} ...\" to the final symmetric sum; this is correct but would be clearer if the factor of 2 and the symmetry between B and C were spelled out explicitly.","section":"Section V.B"},{"comment":"After deriving P_{2m+1}=0 and concluding ρ_A is the maximally mixed state on 2m+1 qubits, the proof states \"a contradiction\" without explaining why this is impossible; adding a rank argument (the complement has only 2m-1 parties, so the rank cannot exceed 2^{2m-1}) would improve clarity.","section":"Theorem 1 proof"},{"comment":"Minor typo: \"expectataion\" should be \"expectation\".","section":"Section V.C"}],"recommendation":"minor_revision","confidential_remarks":"The paper is well within the scope of the journal and the central claim Qex(8)=56 is correct and rigorously supported. The minor issues listed are local presentation problems and do not affect the validity of the results. I recommend minor revision to correct the equation typos and clarify the few opaque counting steps."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: Qex(8)=56 is now a proven statement, the Turán link is the real contribution, and the proof holds up. The lower bound was already known from Zha et al. and Li-Wang, but the matching upper bound is new and is the load-bearing piece. The paper gives general upper bounds for Qex(2k) and Qex(2k+1) expressed as Turán numbers, improves the 4m case by a sharp parity argument, and supplies explicit graph-state constructions plus a probabilistic lower bound with asymptotic density at least 0.288788. The 4-EME graph state T4 is shown to be 3-uniform, hence PEME, by a neat equality-condition argument.\n\nI checked the main line of proof. Theorem 1's parity step is sound: the odd-weight part of (I+P)^2 gives 2P=4P, forcing P=0. The Turán bound ex_4(8,K_5^4)≤56 checks out, and the rank counts for T4's 4-cuts are consistent with 56 full-rank cuts. The appendices are detailed and the algebra works. I do not see a circular step—the parity rule and graph-state rank criterion are external tools, and no parameter is fitted to the target value.\n\nSoft spots are minor. Eq. (19) has a block-dimension typo, Eq. (22) a summation-index typo. The count m4(|T4>)=56 is stated as 'it can be checked' rather than tied directly to the general rank analysis in Section V.B; it is true, but it would be cleaner to compute it there. The abstract's 'third known value' is loose—Qex(5)=10 and Qex(6)=20 follow immediately from AME existence, so 8 is the fifth known value if trivial cases are counted; the introduction correctly says the third nontrivial extremal case. Also, the asymptotic statement is a liminf, not a proven limit, as written. None of these affect the central claim.\n\nThis paper is for people who care about near-AME states, k-uniform states, and quantum-error-correction-motivated combinatorics. It deserves a serious referee; I would accept with minor revisions.","headline":"Qex(8)=56 is proven and the Turán-link framework is the real contribution; the paper is sound and deserves peer review.","tokens_in":18960,"tokens_out":3760,"would_cite":true,"duration_ms":33302,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C65","05D05","81P40"],"pacs":["03.67.Mn","03.67.-a"],"model":"deepseek-v4-flash","headline":"Every eight-qubit pure state has at most 56 maximally mixed 4-party reductions; the graph state |T4⟩ attains the bound and is perfectly extremal.","keywords":["quantum extremal number","absolutely maximally entangled states","k-uniform states","graph states","Turán's problem","Bloch representation","maximally mixed reductions","qubit entanglement"],"falsifier":"An explicit 8-qubit pure state with 57 maximally mixed 4-party reductions would refute Qex(8)=56. Short of that, any 8-qubit state with 56 such reductions whose 3-party reductions are not all maximally mixed would refute Theorem 2's claim that every 4-EME 8-qubit state is PEME.","tokens_in":17831,"feed_emoji":"⚛️","tokens_out":8716,"duration_ms":78790,"temperature":0.7,"pith_summary":"The paper studies a scarcity: an absolutely maximally entangled (AME) state of n qubits exists only for n = 2, 3, 5, and 6, so for every other n one asks which pure state realizes the most \"half-body\" entanglement, i.e. the most ⌊n/2⌋-party reductions that are maximally mixed. The paper defines the quantum extremal number Qex(n) for this maximum, connects it to Turán's problem in hypergraph theory to get a general upper bound, and builds explicit graph states giving lower bounds. Its main result is Qex(8) = 56: no eight-qubit pure state has more than 56 maximally mixed 4-party reductions, and the graph state |T4⟩ attains 56. It also shows that any 8-qubit state achieving 56 must be 3-uniform and hence perfectly extremal, and that similar reasoning proves any 4m-qubit state achieving the new bound must be (2m−1)-uniform.","feed_headline":"56 is the exact maximum for 8-qubit half-body entanglement","feed_subtitle":"Every eight-qubit pure state has at most 56 maximally mixed four-party reductions, and one graph state hits the bound.","key_machinery":"The load-bearing object is the quantum extremal number Qex(n,k), the largest number of k-party reductions that can be maximally mixed in an n-qubit pure state, specialized to k = ⌊n/2⌋. A pure state is encoded as a k-uniform hypergraph on its n parties, with a hyperedge exactly where the reduction is maximally mixed. The upper bound comes from the parity rule (Lemma 1): in the Bloch expansion, a nonvanishing anticommutator of two Pauli tensors has weight congruent to the sum of the weights modulo 2, which forces certain odd-weight Bloch terms to vanish and yields the forbidden complete hypergraph $K^{{2m}}$_{2m+1} for n = 4m. Turán's extremal number then supplies the numerical ceiling. The lower bound is carried by graph states: for a graph state |G⟩, a k-party reduction is maximally mixed exactly when the k×(n−k) submatrix of the adjacency matrix has full rank over F_2, which turns the counting problem into linear algebra; the graph T4 gives the 56 case.","core_discovery":"The central claim is that Qex(8) = 56, the third determined value of the quantum extremal number, after Qex(4) = 4 and Qex(7) = 32. The proof has two halves. On the upper-bound side, every n-qubit pure state is associated with the uniform hypergraph whose edges are the k-subsets with maximally mixed reductions; the authors show that for n = 2k this hypergraph must avoid K^k_{k+2}, and for n = 4m it must avoid $K^{{2m}}$_{2m+1}, and then bound the number of edges by Turán's theorem. For n = 8 this yields the bound 56. On the lower-bound side, the graph state |T4⟩, defined in Eq. (16) by an 8×8 adjacency matrix over F_2, has exactly 56 full-rank 4×4 submatrices, so by the rank criterion for graph states it has 56 maximally mixed 4-party reductions. The paper further proves that any state reaching the bound must be 3-uniform, so |T4⟩ is a PEME state.","pith_inferences":["Extension: the same Turán translation suggests a route to sharper values for n = 10 and n = 12, since any improvement on the hypergraph Turán number for K^k_{k+2} or K^{2m}_{2m+1} would immediately sharpen Qex; known hypergraph Turán densities may apply directly.","Extension: the paper documents that PEME states for 4, 7, and 8 qubits also minimize the potential of multipartite entanglement, but it does not claim a general equivalence; testing whether a 9- or 10-qubit state with the maximum number of maximally mixed half-body reductions also minimizes that potential would be a concrete next check.","Extension: a probabilistic test of the lower bound would be to sample random 8-qubit graph states and count the maximum number of full-rank 4×4 submatrices; the empirical maximum should be 56, and the observed density should lie near the expected product formula as the number of qubits grows."],"forward_implications":["For eight qubits, 4-EME and PEME coincide: every state with the maximum 56 maximally mixed 4-party reductions is 3-uniform, so |T4⟩ and the orthogonal-array state of [21] are two non-locally-equivalent PEME states.","For twelve qubits the improved upper bound is 792, the graph state |T6⟩ gives 512, and a 5-uniform 12-qubit graph state gives 540 maximally mixed 6-party reductions; the 792 bound is not reachable by stabilizer states.","For every m ≥ 2, any pure state of 4m qubits that attains the new Turán-type bound must be (2m−1)-uniform and therefore perfectly extremal.","Asymptotically, a random graph state on 2k qubits has, in expectation, at least C(2k,k) times product_{l=0}^{k-1}(1 − 2^{l−k}) maximally mixed k-party reductions, so the density π(2k,k) approaches at least ∏_{l=1}^{∞}(1 − 2^{−l}) ≈ 0.2888."],"supporting_citations":[{"why":"Supplies the parity rule (Lemma 1) that makes the upper-bound proofs work, and the 7-qubit result Qex(7)=32 that anchors the problem.","marker":"[10]"},{"why":"Gives the first extremal value Qex(4)=4 and the nonexistence of AME(4,2), the template for the extremal question.","marker":"[12]"},{"why":"Provides the lower bound on the covering number T(n,l,k) from which the Turán-type upper bounds on Qex are derived.","marker":"[28, 29]"},{"why":"Provides the rank condition for graph-state reductions (Corollary 2), which turns the lower-bound construction into counting full-rank submatrices.","marker":"[11, 32]"},{"why":"Supplies the orthogonal-array 3-uniform 8-qubit state shown to be another PEME state, used to prove non-LU-equivalence with |T4⟩.","marker":"[21]"}],"fun_headline_variants":["8-qubit pure states top out at 56 mixed 4-party cuts","Exact 8-qubit limit: 56 maximally mixed reductions","Graph state achieves 56-maximum for 8-qubit entanglement","Turán bound pins 8-qubit extremal entanglement to 56","56 is the exact max for 8-qubit half-party reductions"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The upper bound rests on the parity rule inherited from [10], that a nonvanishing anticommutator of two Pauli tensors has weight parity equal to the sum of the weights; if this rule failed for the weight-selected Bloch sums P_j inside the reduced density matrices, the proof that Qex(8) ≤ 56 would no longer go through.","fun_headline_variants_meta":{"raw":{"variants":["8-qubit pure states top out at 56 mixed 4-party cuts","Exact 8-qubit limit: 56 maximally mixed reductions","Graph state achieves 56-maximum for 8-qubit entanglement","Turán bound pins 8-qubit extremal entanglement to 56","56 is the exact max for 8-qubit half-party reductions"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000252,"raw_usage":{"total_tokens":1581,"prompt_tokens":984,"completion_tokens":597,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":600,"completion_tokens_details":{"reasoning_tokens":502}},"tokens_in":600,"tokens_out":597,"duration_ms":5733,"temperature":1.0,"reasoning_tokens":502,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T17:49:43.852526+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"An explicit 8-qubit pure state with 57 maximally mixed 4-party reductions would refute Qex(8)=56. Short of that, any 8-qubit state with 56 such reductions whose 3-party reductions are not all maximally mixed would refute Theorem 2's claim that every 4-EME 8-qubit state is PEME.","supporting_citations":[{"cited_title":"Absolutely maximally entangled states of seven qubits do not exist,","cited_arxiv_id":null,"evidence_quote":"Supplies the parity rule (Lemma 1) that makes the upper-bound proofs work, and the 7-qubit result Qex(7)=32 that anchors the problem."},{"cited_title":"How entangled can two couples get?","cited_arxiv_id":null,"evidence_quote":"Gives the first extremal value Qex(4)=4 and the nonexistence of AME(4,2), the template for the extremal question."},{"cited_title":"k-Uniform quantum states arising from orthogonal arrays,","cited_arxiv_id":null,"evidence_quote":"Supplies the orthogonal-array 3-uniform 8-qubit state shown to be another PEME state, used to prove non-LU-equivalence with |T4⟩."}],"review_version":1}