{"id":"e2a8511d-ed95-48e1-b5cd-91f3acbd29e7","arxiv_id":"2507.11458","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"The paper defines an Entanglement Matrix and claims maximum entanglement of n-qubit graph states is N^2-N for odd N, with piecewise quadratic formulas for even N and a special enhancement for multiples of 12.","lead":"This preprint invents an 'Entanglement Matrix' built from midpoints of lines in drawings of quantum graph states, and uses it to claim that maximum entanglement grows quadratically with the number of qubits. The rules for filling the matrix are assumed, not proven, so the claimed formulas are not established.","discovery_kind":"unclear","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Emax counts chord midpoints rather than computing von Neumann entropies: for the 3-qubit complete graph the paper gives 6 log2 while the actual reduced-state entropy is 1 per cut, so the quadratic and mod-12 formulas are ungrounded.","rationale":"The reader's weakest_assumption focused on the geometric degree pattern for large even N (Section IV, Table III). My read is stronger and more basic: the Entanglement Matrix is defined so that all entries are log2 or multiples of log2 by fiat, so the Emax results are fixed by counting, not by diagonalizing any reduced state. The 3-qubit complete graph provides a direct falsification of this base rule: its exact reduced state has entropy 1 per bipartition, not the values implied by Table I. Therefore the central claim fails even before the questionable extrapolation to C/2 and multiples of 12. I mark agreement as partial because the reader identified a real secondary defect (the unproven alternating-degree geometry), but the load-bearing defect is upstream: the matrix entries were never derived from von Neumann entropy. Since this is an internal numerical inconsistency with an explicit quantum computation, not merely a disagreement with a consensus formula, it supports rejection. I recommend keeping the reader's REJECT verdict; no further adjustment is needed.","tokens_in":11027,"tokens_out":7832,"duration_ms":104113,"concrete_test":"For N=3 and N=4, construct the complete-graph state |G> = prod_{i<j} CZ_{ij} |+>^{⊗N} and compute exact reduced density matrices by partial trace. For each bipartition A|A-bar, use S(ρ_A) = -Tr(ρ_A log2 ρ_A). Then compare with Section III's asserted per-edge value log2 and with the paper's Emax values (6 for N=3; 12 for N=4 from the even formula). If S=1 per cut and the paper's sum rule applied to the three physically distinct cuts gives 3 (and not 6 or 12), the matrix entries in Table I and the formulas in Section IV are not entropies. This settles the concern without relying on any extrapolation.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim collapses at the point where Section III converts midpoints into matrix entries. Step 3 and the inference after Fig. 4 assign every CZ edge a von Neumann entanglement of log2 and set the SS entry of a secondary midpoint of degree d to (d/2) log2; no partial trace of the actual graph state is performed. All Emax formulas then reduce to counting points on a drawing. This is not merely an unsupported geometric extrapolation: it is numerically wrong for the smallest complete graph. For N=3, the complete graph state is the triangle (GHZ-class) state; its reduced density matrix for any 1-vs-2 bipartition, obtained by tracing out two qubits, is diag(1/2,1/2), giving S=1, and summing the three single-qubit cuts gives 3. Table I instead reports 6 log2 for the fully entangled class. Thus the bookkeeping overcounts by a factor of two already at N=3. Since Eq. (2) and every even-N formula (Eqs. (3)-(10)) are built entirely from this bookkeeping, the quadratic growth and the multiples-of-12 enhancement are consequences of the definitions, not of the quantum state. The paper's own admission that the mod-12 replacement has 'reason... still not clear' flags the same missing derivation: no physical mechanism is offered linking a geometric chord pattern to the spectrum of a reduced density matrix.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces an 'Entanglement Matrix' formalism for n-qubit graph states. Midpoints of graph edges are classified as primary or secondary, each matrix entry is assigned a von Neumann entropy contribution (log2 2 for primary midpoints and (d/2) log2 2 for secondary midpoints of degree d), and total entanglement is defined as the sum of the diagonal and one triangular part of this matrix. The paper claims that maximum entanglement is N^2 - N for odd N, and for even N is given by piecewise quadratic formulas, with an enhanced value 5N^2/4 when N is a multiple of 12. A classification of three- and four-qubit non-isomorphic graph states is also presented.","tokens_in":11453,"tokens_out":3972,"duration_ms":46445,"significance":"If correct, the paper would provide a simple closed-form quantification of maximum entanglement in graph states, with interesting number-theoretic structure. The paper does provide a clear organization of non-isomorphic classes for small N and tabulates midpoint-degree data for larger N. However, the central claim is not derived from the quantum state: no reduced density matrix is computed for any graph state beyond N=3, and the paper's own admission that the multiples-of-12 feature has 'reason... still not clear' indicates the absence of a physical derivation. The main quantitative result is already contradicted by the simplest complete graph state, so the contribution cannot be considered valid in its current form.","major_comments":[{"comment":"The Entanglement Matrix entries are posited rather than derived. The text asserts that each CZ edge contributes log2 2 and that a secondary midpoint of degree d contributes (d/2) log2 2, but no partial trace, Schmidt decomposition, or eigenvalue calculation is performed for any graph state. Since total entanglement is then defined as the sum of diagonal plus one triangular block of this matrix, all formulas in Eqs. (2)-(10) are arithmetic consequences of these definitions rather than predictions from quantum mechanics.","section":"Section III, Step 3 and discussion after Fig. 4"},{"comment":"For the 3-qubit complete graph state (the GHZ-class state), tracing out any two qubits yields the reduced density matrix diag(1/2,1/2), so the von Neumann entropy of a 1-vs-2 bipartition is 1; summing the three single-qubit cuts gives 3. Table I instead reports 6 log2 2 for the fully entangled class, overcounting by a factor of two already at N=3. This is a quantitative failure of the proposed bookkeeping, not merely a missing proof.","section":"Table I, Class 4"},{"comment":"The even-N formulas in Eqs. (3)-(6) rely on the unproven geometric claim that, in a complete graph drawn with vertices in convex position, midpoint degrees alternate between 2 and 4 on concentric circles and the central midpoint has degree N. The pattern is inferred from Table III for a few small N and extrapolated to all even N. If this midpoint-degree pattern fails for larger N, the piecewise quadratic expressions and the distinction between C/2 integer and non-integer cases collapse; no proof of this geometric claim is supplied.","section":"Section IV, 'Bipartite Entanglement Calculation' and Table III"},{"comment":"The multiples-of-12 case is handled by introducing an ad hoc replacement of one midpoint degree (2 by 6, or 4 by 8), with the paper stating that the reason is 'still not clear.' Equations (7)-(10) then adjust the counts so that the final Emax becomes 5N^2/4. This is not a derived prediction but a fitting procedure: the replacement term is chosen to preserve the desired quadratic form, and there is no independent check against actual entanglement entropies of the corresponding graph states.","section":"Section IV, 'A Special case of Even graph States' and Table IV"}],"minor_comments":[{"comment":"The notation for the size of the Entanglement Matrix is inconsistent: the text says it is n×n with n the total number of midpoints, but in the 4-qubit example the matrix is 5×5 while the number of qubits is 4.","section":"Section III"},{"comment":"The text refers to 'Equation (1)' when citing the odd-graph formula, but Eq. (1) is the definition of von Neumann entropy; the intended reference is Eq. (2).","section":"Section IV, Eq. (2)"},{"comment":"References [5] and [12] cite Wikipedia and an arXiv preprint for graph isomorphism, respectively; more standard sources would be appropriate for these textbook notions.","section":"References"},{"comment":"There are numerous typographical issues, including 'T otal', 'EM ax', 'R´enyi', and inconsistent use of log2 versus log2 2; a careful proofreading pass is needed.","section":"Throughout"}],"recommendation":"reject","confidential_remarks":"The manuscript's central claim fails already at N=3, and the even-N formulas are built from an unproven geometric pattern plus an openly acknowledged ad hoc mod-12 adjustment. Even a major revision would require replacing the entire derivation with an actual computation of reduced-state entropies, which is beyond the scope of the current presentation. I would not recommend this paper for publication in its present form."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear Colleague,\n\nThe short version: this paper's central result does not hold. The 'Entanglement Matrix' is a bookkeeping device, not a quantum-mechanical calculation, and the paper's own numbers fail on the smallest nontrivial case. For the three-qubit complete graph (the GHZ-class triangle), the correct von Neumann entanglement, summed over the three 1-vs-2 cuts, is 3 (each reduced state has eigenvalues 1/2,1/2). Table I classifies this as 'fully entangled' with total entanglement 6 log2 – a factor of two overcount. Since Eq. (2) and every even-N formula are built from the same rule (every edge contributes log2, every secondary midpoint of degree d contributes (d/2) log2), the quadratic growth and the mod-12 enhancement are consequences of definitions, not of the quantum state.\n\nWhat is genuinely new: the Entanglement Matrix construction, the primary/secondary midpoint distinction, and the explicit piecewise formulas do not appear in the cited literature. The paper is organized, the tables and figures are clear, and the author honestly notes that the mod-12 replacement 'reason is still not clear.' That honesty is welcome, but it does not rescue the derivation. The 'Bipartite Entanglement Calculation' in Section IV rests on an unproven geometric claim about concentric circles and alternating midpoint degrees 2 and 4, extrapolated from Table III to all even N. No partial trace is ever performed. The special multiples-of-12 case is an ad hoc patch, and the concluding experimental paragraph cites a specific Nature Physics result without establishing any concrete connection to the Entanglement Matrix.\n\nThe known four-qubit graph-state classification (Hein et al., cited in the paper) should have been a check; instead the paper defines its own categories without comparing spectra or entropies. That citation pattern is a red flag, though the paper does cite the standard references.\n\nBottom line: this is not a paper a serious journal should send to referees. It is a self-contained formalism that is internally coherent but ungrounded, and it is numerically wrong for N=3. I would desk-reject it, with a note pointing to the K3 check. If the author ever derives the matrix entries from reduced density matrices, the mod-12 result might become interesting, but as it stands it is numerology.\n\nI don't want to spend group time on it. My vote: reject.","headline":"The Entanglement Matrix is a bookkeeping device, not a quantum measure, and it overcounts the 3-qubit GHZ state by a factor of two.","tokens_in":11830,"tokens_out":3295,"would_cite":false,"duration_ms":36697,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P40","81P68"],"pacs":[],"model":"deepseek-v4-flash","headline":"Maximum entanglement of complete $n$-qubit graph states is exactly piecewise quadratic, with a boost when $n$ is a multiple of 12.","keywords":["graph states","entanglement matrix","von Neumann entropy","multipartite entanglement","entanglement classification","controlled-Z gate","midpoint degree","quadratic entanglement scaling"],"falsifier":"Take an even $n$ not covered by the paper's tables, such as $n=14$ or $n=20$, draw the complete graph with vertices in convex position, and list every edge midpoint with the number of edges passing through it; if the alternating 2/4 degree pattern, the central degree-$n$ midpoint, or the single exceptional midpoint fails, the piecewise quadratic formulas and the mod-12 anomaly collapse.","tokens_in":10846,"feed_emoji":"⚛️","tokens_out":13723,"duration_ms":151915,"temperature":0.7,"pith_summary":"Graph states are the resource states behind quantum error correction, quantum communication, and measurement-based computation, so a closed-form maximum entanglement gives a concrete target for state preparation. The paper introduces the Entanglement Matrix, a symmetric array whose entries record bipartite entanglement between edge midpoints of a graph state, and uses it to classify how much entanglement a fully connected $n$-qubit graph state can hold. Its central claim is that the maximum entanglement, counted in units of $\\log 2$ per contributing line through a midpoint, is exactly quadratic in $n$: $E_{\\max}=n^2-n$ for odd $n$, $5n^2/4-3n/2$ for even $n$ with $C/2$ an integer, $5n^2/4-2n$ for even $n$ with $C/2$ non-integer, and $5n^2/4$ for even $n$ that are multiples of 12, where $C=n/2-1$ is the number of concentric circles of midpoints. If correct, this gives a complete analytical classification of the most entangled class of $n$-qubit graph states and identifies $n$ divisible by 12 as a special family with enhanced entanglement. The author notes that the reason for the multiples-of-12 anomaly remains an open question.","feed_headline":"Max entanglement of n-qubit graph states is piecewise quadratic","feed_subtitle":"Maximum entanglement grows quadratically and jumps for multiples of 12 under the new Entanglement Matrix classification.","key_machinery":"The Entanglement Matrix is an $M\\times M$ symmetric matrix, with $M=\\binom{n}{2}$ for odd $n$ and $M=n(n/2-1)+1$ for even $n$, whose entries are entanglement contributions between edge midpoints. Primary midpoints (edges between adjacent qubits) have degree 2 and fill the first $n\\times n$ block, while secondary midpoints (edges between non-adjacent qubits) have degree $d\\ge2$ and fill only diagonal entries, each line through a midpoint contributing one unit of $\\log 2$. The total entanglement is the sum of the diagonal plus one triangular half, so the whole maximum-entanglement calculation reduces to counting midpoints by degree on concentric circles, with the central midpoint of degree $n$ in even graphs.","core_discovery":"The discovery the author claims is that maximum entanglement of complete $n$-qubit graph states, expressed through the Entanglement Matrix with von Neumann entropy, is fixed by a simple degree-counting rule: each midpoint of an edge contributes $\\log 2$ per line passing through it, and the total is the sum of the matrix diagonal and one triangular half. Because odd-$n$ complete graphs produce only degree-2 midpoints, this sum evaluates to $n^2-n$. Even-$n$ complete graphs add concentric rings of midpoints whose degrees alternate between 2 and 4 plus a central midpoint of degree $n$, producing larger quadratic values; when $n$ is a multiple of 12, one ring midpoint acquires degree 6 or 8 and the formula becomes exactly $5n^2/4$. The four cases together form the claimed maximum-entanglement classification.","pith_inferences":["The Entanglement Matrix total adds contributions from many bipartitions, so its quadratic scaling is a classification score rather than the von Neumann entropy of any single bipartition; comparing it to standard entropy bounds requires care.","The mod-12 pattern is a number-theoretic prediction that can be tested independently of quantum mechanics by enumerating edge midpoints of complete graphs on $n=60$ and $n=72$ vertices in convex position.","The same midpoint-degree counting could extend to non-complete graphs or to the Renyi and Tsallis entropies the paper lists but does not apply, though the paper does not develop these extensions."],"forward_implications":["If the formulas are correct, every $n$-qubit graph state has entanglement at most the piecewise quadratic bound, and the complete graph state attains it.","Even-qubit complete graph states carry more entanglement than odd-qubit ones at the same $n$, with the gap growing roughly as $n^2/4$.","Graph states with $n$ a multiple of 12 form a distinct maximum-entanglement class, reaching $5n^2/4$; the paper's Table IV predicts degree-6 replacement for odd multiples and degree-8 replacement for even multiples.","The Entanglement Matrix organizes small non-isomorphic graph states into separable, bi-separable, entangled, and fully entangled classes, as tabulated for three and four qubits.","Because the paper cites an atomic-ensemble experimental realization of graph states, the midpoint-degree counting could be translated into a certificate for maximum entanglement in prepared states."],"supporting_citations":[{"why":"Supplies the graph-state model in which vertices are qubits and edges are interactions.","marker":"[5]"},{"why":"Gives the formal construction of an $n$-qubit graph state as a product of controlled-Z gates over the edge set.","marker":"[13–15]"},{"why":"Provides the enumeration of non-isomorphic three- and four-qubit graph states used in the classification tables.","marker":"[16]"},{"why":"Supplies the von Neumann entropy whose value $\\log 2$ per qubit sets the unit for every entanglement-matrix entry.","marker":"[20]"},{"why":"Provides the atomic-ensemble experimental realization the paper's conclusion connects to for implementing the scheme.","marker":"[7]"}],"fun_headline_variants":["Graph-state max entanglement: piecewise quadratic, jumps at 12","Entanglement matrix: graph-state max entanglement is quadratic, with odd/even rules","Odd vs even qubits: max graph-state entanglement is quadratic","Max graph-state entanglement: n²−n for odd, more for even","Multiples of 12 boost: graph-state entanglement max is quadratic"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The even-$n$ formulas assume an unproved geometric extrapolation: in a complete graph drawn with vertices on a circle, edge midpoints lie on concentric circles with degrees alternating between 2 and 4 from the outside inward, a central midpoint of degree $n$, and, for $n$ a multiple of 12, exactly one exceptional midpoint of degree 6 or 8.","fun_headline_variants_meta":{"raw":{"variants":["Graph-state max entanglement: piecewise quadratic, jumps at 12","Entanglement matrix: graph-state max entanglement is quadratic, with odd/even rules","Odd vs even qubits: max graph-state entanglement is quadratic","Max graph-state entanglement: n²−n for odd, more for even","Multiples of 12 boost: graph-state entanglement max is quadratic"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001321,"raw_usage":{"total_tokens":5376,"prompt_tokens":941,"completion_tokens":4435,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":557,"completion_tokens_details":{"reasoning_tokens":4340}},"tokens_in":557,"tokens_out":4435,"duration_ms":38321,"temperature":1.0,"reasoning_tokens":4340,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T17:09:40.158507+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take an even $n$ not covered by the paper's tables, such as $n=14$ or $n=20$, draw the complete graph with vertices in convex position, and list every edge midpoint with the number of edges passing through it; if the alternating 2/4 degree pattern, the central degree-$n$ midpoint, or the single exceptional midpoint fails, the piecewise quadratic formulas and the mod-12 anomaly collapse.","supporting_citations":[{"cited_title":"En- tanglement matrix is a n × n square symmetric ma- trix, where n is the total number of midpoints in a given graph","cited_arxiv_id":null,"evidence_quote":"Supplies the graph-state model in which vertices are qubits and edges are interactions."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the enumeration of non-isomorphic three- and four-qubit graph states used in the classification tables."},{"cited_title":"Vesperini and R","cited_arxiv_id":null,"evidence_quote":"Supplies the von Neumann entropy whose value $\\log 2$ per qubit sets the unit for every entanglement-matrix entry."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the atomic-ensemble experimental realization the paper's conclusion connects to for implementing the scheme."}],"review_version":1}