{"id":"9fad4541-5211-40f0-bef2-df45aef377a0","arxiv_id":"2607.15548","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"For states whose support is the set of bases of a matroid, genuine multipartite entanglement is tied to matroid connectivity, measurement to minors, and bit-flip duality to matroid duality.","lead":"The paper introduces quantum states whose nonzero computational-basis terms are exactly the bases of a matroid, and connects genuine multipartite entanglement to matroid connectivity, Z-basis measurement to matroid minors, and bit-flipped dual states to dual matroids. If its central lemma were correct, it would give a purely combinatorial handle on entanglement for a natural class of fixed-weight states.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 9 is false: |100⟩ has irreducible polynomial x1 yet is biseparable; |0⟩⊗(|10⟩+|01⟩) has irreducible polynomial x2+x3 yet is not GME. This invalidates the proof bridge used in Theorems 1–2, even if the theorems themselves are repairable.","rationale":"The reader's strongest claim correctly identifies Lemma 9 as false, and the counterexamples are decisive. My stress-test diverges from the reader's weakest_assumption: the complex-coefficient extension of Lemma 8 is not where I would place the weight. For a homogeneous multiaffine polynomial whose support is the bases of a connected matroid, any factorization would split variables into two nonempty blocks; homogeneity forces both factors to have positive constant degree, so every basis has exactly r1 elements from one block and r2 from the other, giving r(T)+r(E\\T)=r(E) and contradicting connectedness. This argument is field-independent, so Lemma 8 likely survives over C. The real fault is the converse half of Lemma 9. The second counterexample falls inside the matroid-supported class, so the failure is directly relevant to the paper's framework. Theorems 1 and 2 are probably true and repairable by the rank argument in the concrete test, but the submitted proofs rely on a false lemma. Therefore the reader's REJECT verdict is unchanged.","tokens_in":16682,"tokens_out":12381,"duration_ms":139233,"concrete_test":"Directly falsify Lemma 9 on |100⟩: compute g=x1, note x1 has no factorization into nonconstant polynomials, and observe that the state is biseparable under {1}|{2,3}. Also test |0⟩⊗(|10⟩+|01⟩), whose support is the bases of the disconnected matroid U_{0,1}⊕U_{1,2}; its polynomial x2+x3 is irreducible but the state is a product across {1}|{2,3}. These two examples settle the falsity of the lemma. To test whether Theorems 1–2 survive without it, check the repair: prove that if a matroid-supported state factors across T|T^c, then the supports of the two factors are homogeneous and r(T)+r(E\\T)=r(E), so the supporting matroid is disconnected. If this rank argument cannot be completed, the central theorems remain unsupported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Lemma 9 claims GME ⇔ irreducibility of the generating polynomial. The forward direction (reducible ⇒ biseparable) is fine, but the converse is false because a tensor factor can have generating polynomial 1. For |ψ⟩=|100⟩=|1⟩⊗|00⟩, g_ψ(x)=x1, which is irreducible over C, yet |ψ⟩ is biseparable under the partition {1}|{2,3}. This is not an artifact of non-matroid states: |φ⟩=|0⟩⊗(|10⟩+|01⟩) has support {{2},{3}}, which is the set of bases of the matroid U_{0,1}⊕U_{1,2} on {1,2,3} (element 1 is a loop), and its polynomial x2+x3 is irreducible, while the state is a product across {1}|{2,3}. Thus the proof of Theorem 1, which combines Lemma 8 (connected ⇒ irreducible) with Lemma 9 (irreducible ⇒ GME), does not go through; the same bridge is used in the sufficiency direction of Theorem 2. This is load-bearing because Figure 1 announces this as the logical framework. The main theorem statements are probably salvageable: a biseparable matroid-supported state has support of the form X×Y across the partition, and because all bases have equal cardinality the factor supports are homogeneous, forcing r(T)+r(E\\T)=r(E), i.e. the supporting matroid is disconnected. But the paper does not provide that argument. The complex-coefficient extension in Lemma 8 is not the central problem: the support-based factorization argument is field-independent.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces matroid-supported quantum states and matroid-base states, associating to each n-qubit state a multiaffine generating polynomial whose support is the set of bases of a matroid. It claims: (i) any matroid-supported state whose supporting matroid is connected is genuinely multipartite entangled (Theorem 1); (ii) a uniform superposition over all bases of a matroid is GME iff the matroid is connected (Theorem 2); (iii) Z-basis measurements produce matroid-supported states whose supporting matroid is a minor (Theorem 4); and (iv) a 'dual state' defined by X^{⊗n} corresponds to matroid duality (Propositions 5–7). The proof strategy is to connect matroid connectivity to polynomial irreducibility and then to GME via Lemma 9.","tokens_in":17033,"tokens_out":8918,"duration_ms":92054,"significance":"The proposed combinatorial characterization is attractive and, if established, would give a coefficient-independent sufficient condition for GME in matroid-supported states and a complete characterization for matroid-base states. The measurement–minor correspondence is elegant and appears essentially correct. The paper also contains useful examples, including Example 5, which correctly shows that a disconnected supporting matroid does not preclude GME. However, the central algebraic bridge, Lemma 9, is false as stated, and the complex-coefficient extension of Lemma 8 is not justified. These are load-bearing issues for Theorems 1–2, so the paper cannot be accepted in its present form, although the main theorems may be salvageable by a direct support-factorization argument.","major_comments":[{"comment":"Lemma 9 states that a quantum state is genuinely entangled iff its generating polynomial is irreducible. The converse direction is false. For |ψ⟩=|1⟩⊗|00⟩, g_ψ(x)=x_1, which is irreducible over C, yet the state is biseparable under the partition {1}|{2,3}. Even within the matroid-supported class, |φ⟩=|0⟩⊗(|10⟩+|01⟩) has support {{2},{3}}, which is the set of bases of the matroid U_{0,1}⊕U_{1,2} on [3], and g_φ(x)=x_2+x_3 is irreducible while |φ⟩ is a product across {1}|{2,3}. Since Theorem 1 is proved by composing Lemma 8 with Lemma 9, and Theorem 2's sufficiency relies on Theorem 1, the proof framework in Figure 1 does not go through. The statements of Theorems 1–2 may still be true and repairable, e.g. by showing that a biseparable matroid-supported state has support of the form X×Y and hence a disconnected supporting matroid, but that argument is not in the manuscript.","section":"Section III.A, Lemma 9"},{"comment":"Lemma 8 asserts that a multiaffine polynomial whose support is the bases of a connected matroid is irreducible over C, citing [36, Prop. 4.6] for real coefficients and claiming that the result holds over complex coefficients 'without requiring any changes to the proof.' This is not self-evident: real irreducibility does not imply complex irreducibility in general. No proof of the complex-coefficient extension is supplied. Since Lemma 8 is the only route from connectedness to irreducibility used in Theorem 1, this is a second load-bearing gap in the proof. A support-based factorization argument would avoid this issue entirely.","section":"Section III.A, Lemma 8"},{"comment":"The necessity direction of Theorem 2 uses Lemma 9 to infer irreducibility of the generating polynomial from GME. Although that particular implication is true (it is the contrapositive of reducible⇒biseparable), the proof as written relies on the false equivalence stated in Lemma 9, so it is not valid within the manuscript's logical framework. Moreover, the sufficiency direction depends on Theorem 1, whose proof is invalid for the reasons above. The theorem may be true, but the presented proof needs to be rebuilt on a sound lemma.","section":"Section III.B, Theorem 2"}],"minor_comments":[{"comment":"The definition of the dual state is missing the complement on the basis label. X^{⊗n}|S⟩ = |E\\S⟩ (or |\\bar S⟩), so |ψ⟩^* should be written as ∑_S α_S |E\\S⟩, not ∑_S α_S |S⟩. The same omission appears in Eq. (17)–(18) of Proposition 6, where the state is rewritten as a sum over B(M*) without changing the basis label; the conclusion is true but the displayed algebra is incorrect.","section":"Definition 12, Eq. (15)"},{"comment":"The direction labels (⇐) and (⇒) in the proof are confusing: the first part proves biseparable⇒reducible, and the second proves reducible⇒biseparable. More importantly, the reducible⇒biseparable argument implicitly assumes that both factors are non-constant; the counterexample |100⟩ arises precisely because one factor may be the constant polynomial 1.","section":"Section III.A, Lemma 9 proof"},{"comment":"Minor typos: 'unifom matroid' should be 'uniform matroid'; 'matriods' should be 'matroids'; the phrase 'affine homogeneous polynomial' in Section III should be 'multiaffine homogeneous polynomial'.","section":"Corollary 3 and Section IV.B"},{"comment":"The notation B_e and B^e is introduced informally. It would help to define B_e = {B∈B : e∉B} and B^e = {B∈B : e∈B} explicitly before the proof, and to state the loop/coloop edge cases, since Definition 8 treats those separately.","section":"Lemma 10"}],"recommendation":"major_revision","confidential_remarks":"The main theorems appear likely to be true, and the flaw is localized to the polynomial-irreducibility bridge. I recommend major revision rather than rejection because the claims are defensible and the proof can be repaired by replacing Lemma 9 with a direct support-factorization argument, and by either proving or removing the complex-coefficient claim in Lemma 8. However, the current manuscript's central proof is invalid, so it should not be published without those fixes."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this paper introduces a genuinely new way to think about certain multipartite states—matroid-supported states and matroid-base states—and the measurement-to-minor and duality-to-dual-matroid correspondences are clean and likely correct. The problem is the central bridge Lemma 9, which claims GME iff irreducible generating polynomial. The forward direction is fine; the converse is false. |100> has generating polynomial x1, irreducible over C, yet the state is biseparable under {1}|{2,3}. The same issue appears inside the intended class: |0>⊗(|10>+|01>) has support {{2},{3}}, which are the bases of U_{0,1}⊕U_{1,2}, its polynomial x2+x3 is irreducible, and the state is a product across {1}|{2,3}. So Lemma 9 cannot serve as the proof bridge for Theorems 1 and 2 as written.\n\nCredit where due: the definitions are new, and the correspondences listed above are not in the cited literature. The measurement and duality sections look solid and are the most useful part. The paper is also honest about not having concrete applications yet; the discussion is speculative but clearly labeled.\n\nThe soft spots are load-bearing. Lemma 8 is taken from [36] for real coefficients, and the extension to complex coefficients is asserted without proof. That extension is probably not the main obstacle—a support-based factorization argument would be field-independent—but the paper should justify it. The necessity proof of Theorem 2 also fails to handle direct-sum components with rank 0 or full rank. My hunch is the main characterization for matroid-base states is true: a biseparable matroid-supported state should force a tensor-product support structure and hence a disconnected supporting matroid, but that argument is absent. The paper needs to replace Lemma 9 with a support-based argument and patch the edge cases.\n\nBottom line: promising framework, real proof bug. I would not cite it in its current form, but I would send it to a referee—the error is repairable, the counterexamples are checkable, and the measurement-to-minor correspondence deserves an archival home.","headline":"A genuinely new matroid-to-quantum dictionary, but the central lemma connecting irreducibility to GME is false, so the main theorems need repair; the framework looks salvageable.","tokens_in":17578,"tokens_out":2174,"would_cite":false,"duration_ms":25352,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims a structural correspondence between quantum states and matroids: for states whose support is a matroid's base collection, genuine multipartite entanglement is governed by matroid connectivity, and Z-measurements act as matr","keywords":["matroid-supported states","matroid-base states","genuine multipartite entanglement","generating polynomial","matroid connectivity","matroid minors","matroid duality","quantum measurement"],"falsifier":"The 3-qubit state |100⟩ has generating polynomial x1, which is irreducible over the complex numbers, yet the state factors as |1⟩⊗|00⟩ and is therefore not genuinely entangled. This directly contradicts the 'irreducible implies genuinely entangled' half of Lemma 9, the step that carries Theorem 1 and the sufficiency half of Theorem 2. A similar test is |0⟩⊗(|10⟩+|01⟩), whose polynomial x2+x3 is irreducible while the state is a product across the partition {1}|{2,3}.","tokens_in":16518,"feed_emoji":"🔗","tokens_out":9152,"duration_ms":89245,"temperature":0.7,"pith_summary":"The paper tries to establish a structural dictionary between quantum states and matroids. It introduces matroid-supported states, whose nonzero computational-basis amplitudes sit exactly on the bases of a matroid, and matroid-base states, the uniform superposition over all bases. Its central claims are that a connected supporting matroid forces genuine multipartite entanglement, and that for matroid-base states this condition is also necessary. A reader should care because the framework offers a purely combinatorial route to certifying entanglement without examining coefficients, and it predicts how entanglement behaves under Z-basis measurements and under the X⊗n dual-state operation.","feed_headline":"Matroid connectivity certifies genuine entanglement","feed_subtitle":"For uniform superpositions over a matroid's bases, connectedness is the exact test for genuine entanglement.","key_machinery":"The load-bearing tool is the generating polynomial of a quantum state: the multiaffine polynomial whose monomials are the computational basis states in the support, with amplitudes as coefficients. The paper uses two lemmas to connect quantum and combinatorial notions: a state is genuinely entangled if and only if its generating polynomial is irreducible, and a multiaffine polynomial whose support is the set of bases of a connected matroid is irreducible. Matroid connectivity, deletion/contraction, and duality then carry the entanglement, measurement, and duality results.","core_discovery":"The paper's central discovery is a correspondence between quantum entanglement and matroid structure. For a state whose support is exactly the collection of bases of a matroid, the paper claims that the combinatorial property of matroid connectivity controls genuine multipartite entanglement: connectedness of the supporting matroid is sufficient for such a state to be genuinely entangled, and for the uniform superposition over all bases it is necessary and sufficient. The same dictionary maps a Z-basis measurement on one qubit to deletion (outcome 0) or contraction (outcome 1), so any sequence of Z-measurements yields a matroid minor of the original supporting matroid. Finally, applying X⊗n","pith_inferences":["If the correspondence is robust, entanglement measures of matroid-base states become indirect probes of matroid connectivity, and matroid algorithms could certify GME without ever writing down the state.","A testable extension is to scan all matroids on small ground sets and compare connectedness against the genuine entanglement of their base states; this would separate the combinatorial criterion from artifacts of the polynomial lemma.","Because the proof hinges on a polynomial irreducibility lemma, a conservative refinement would restrict the claimed criterion to states whose generating polynomials satisfy a nondegeneracy condition, and test whether the connected-matroid characterization survives on that class."],"forward_implications":["Every matroid-base state over a connected matroid is guaranteed genuinely entangled, giving W states, Dicke states, and uniform matroid superpositions a uniform combinatorial certificate of GME.","For matroid-base states, disconnection of the matroid certifies biseparability, so whether such a state is genuinely entangled can be decided by a purely combinatorial test on the matroid, independent of amplitudes.","Z-basis measurements on a matroid-supported state preserve the matroid-supported form: outcome 0 deletes the measured element and outcome 1 contracts it, so any sequence of Z-measurements yields a state supported on a matroid minor.","The X⊗n dual of a matroid-supported state is supported on the dual matroid, and the dual of a matroid-base state is the base state of the dual matroid; genuine entanglement is preserved under this duality.","Matroid duality and connectivity are linked, so the connectedness of a state's supporting matroid and the connectedness of its dual matroid are equivalent."],"fun_headline_variants":["Connected matroid means entangled quantum state","Matroid connectivity is the entanglement test","Quantum states, matroids: entanglement decoded","Z-measurements yield matroid minors","Matroid duality mirrors state transformations"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The argument leans on the equivalence between genuine entanglement and irreducibility of the generating polynomial — specifically, the direction that says an irreducible generating polynomial forces the state to be genuinely entangled; if that equivalence has exceptions, the connected-matroid-suffices claims lose their proof.","fun_headline_variants_meta":{"raw":{"variants":["Connected matroid means entangled quantum state","Matroid connectivity is the entanglement test","Quantum states, matroids: entanglement decoded","Z-measurements yield matroid minors","Matroid duality mirrors state transformations"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000519,"raw_usage":{"total_tokens":2301,"prompt_tokens":644,"completion_tokens":1657,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":388,"completion_tokens_details":{"reasoning_tokens":1595}},"tokens_in":388,"tokens_out":1657,"duration_ms":13970,"temperature":1.0,"reasoning_tokens":1595,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T23:00:49.625254+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"The 3-qubit state |100⟩ has generating polynomial x1, which is irreducible over the complex numbers, yet the state factors as |1⟩⊗|00⟩ and is therefore not genuinely entangled. This directly contradicts the 'irreducible implies genuinely entangled' half of Lemma 9, the step that carries Theorem 1 and the sufficiency half of Theorem 2. A similar test is |0⟩⊗(|10⟩+|01⟩), whose polynomial x2+x3 is irreducible while the state is a product across the partition {1}|{2,3}.","supporting_citations":[],"review_version":1}