{"id":"bb731f72-b70c-4b05-a7ee-7b6a5ec38c36","arxiv_id":"2607.09066","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Two-particle Grover walks on K_n,n attain the upper bound of entanglement entropy from the given initial states if and only if n=1 or 2.","lead":"The authors define a two-particle Grover walk on a graph via the one-particle walk on its Kronecker product and prove the evolution preserves exchange symmetry. For complete bipartite graphs K_n,n they show maximal entanglement entropy is attained from given initial states precisely when n equals 1 or 2.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The paper’s strongest claim is a complete classification for a concrete, finite family of graphs and a concrete family of initial states. All steps needed for that classification—periodicity, explicit action of U and U*, extraction of a single matrix entry, and elementary comparison with 1/|A|—are written out and can be verified by direct calculation. The reader correctly notes that the result is limited to those initial states and to graphs whose Grover walk is 4-periodic, but that limitation is already part of the theorem statement; it does not constitute a gap inside the proof. No load-bearing soft spot was found that would justify changing the ACCEPT verdict.","tokens_in":15727,"tokens_out":482,"duration_ms":5172,"concrete_test":"Independently recompute the (x1,y1),(x1,y1)-entry of Ψ±_2(Ψ±_2)* from the explicit formula for ψ±_2 in Lemma 4.2 and verify that it equals (n^{3}-4n+4)^{2}/(2n^{6}); confirm that this equals 1/(2n^{2}) if and only if n=2 among integers n≥2.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central classification (Theorem 4.5 / 1.2) is proved by exhaustive, hand-checkable computation of the four states of a 4-periodic walk. The only external input is the known period-4 property of the one-particle Grover walk on complete bipartite graphs (Higuchi et al.), which is correctly invoked via Lemma 4.1. The diagonal-entry calculations that rule out maximality for n>2 are elementary algebraic identities that hold for all integers n≥2; no hidden analytic continuation, asymptotic approximation, or unstated spectral assumption appears. The restriction to the single-edge initial states (4.1) is stated explicitly and does not undermine the claim as formulated. Consequently the argument is internally closed and the reader’s weakest-assumption remark does not identify a correctness risk.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper defines a two-particle Grover walk of identical particles on a graph G by transporting the one-particle Grover walk on the Kronecker product G ⊗ G via a natural arc-space isomorphism R. Using the automorphism of G ⊗ G that swaps the two factors, it proves that the resulting unitary U commutes with the particle-exchange operator P (Theorem 1.1 / 3.2), so bosonic and fermionic subspaces are preserved. Entanglement entropy is then studied for the family of single-edge initial states (4.1) on the complete bipartite graphs K_{n,n}. Because K_{n,n} ⊗ K_{n,n} is a disjoint union of two copies of K_{n^{2},n^{2}} and the one-particle Grover walk on complete bipartite graphs is 4-periodic, the two-particle walk is 4-periodic for n ≥ 2. Explicit amplitude matrices at times 0–3 are computed; the maximality criterion ΨΨ* = (1/|A|)I holds if and only if n = 1 (every time) or n = 2 (times \tau ≡ 2 mod 4). The classification is therefore exhaustive for the chosen initial data.","tokens_in":15926,"tokens_out":731,"duration_ms":7630,"significance":"The construction supplies a clean, interaction-bearing two-particle model that automatically respects particle indistinguishability, something that is not automatic for ad-hoc local-interaction models. The complete classification for K_{n,n} is a concrete, falsifiable statement obtained by elementary linear algebra once the known period-4 property is invoked; no free parameters or numerical fitting appear. The result therefore gives a first rigorous benchmark for when a two-particle Grover walk can generate maximal entanglement from a minimally entangled initial state, and it opens a natural line of questions about other graphs that admit perfect state transfer or periodicity.","major_comments":[],"minor_comments":[{"comment":"The abstract and Theorem 1.2 both state the classification for K_{n,n}, but the body labels the same statement as Theorem 4.5; a single consistent numbering would help readers.","section":null},{"comment":"In the proof of Lemma 4.1 the spectral argument is correct, yet a short direct verification that the two connected components of K_{n,n} ⊗ K_{n,n} are each isomorphic to K_{n^{2},n^{2}} would make the isomorphism fully self-contained.","section":null},{"comment":"Equation (3.5) uses the natural logarithm; a parenthetical remark that any base merely rescales the upper bound log|A| would remove a possible source of confusion for readers accustomed to log_{2}.","section":null},{"comment":"The numerical observation that P_5 also attains the bound is mentioned only in the final discussion; a one-sentence pointer to the relevant periodicity references already cited would strengthen the speculative paragraph without lengthening the paper.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is short, self-contained and mathematically clean. Its novelty lies more in the conceptual construction and the complete classification for a natural family than in deep new techniques; it is therefore a good fit for a specialized quantum-information or algebraic-graph-theory venue, but may be borderline for a broad-interest journal that expects larger families or asymptotic results. No citation or priority issues are apparent."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The new piece is the definition itself: lift the two-particle space on G to the one-particle Grover walk on the Kronecker product G⊗G via the natural arc bijection R, then prove that the resulting unitary automatically commutes with the swap operator because the transposition (x,y)↦(y,x) is a graph automorphism of G⊗G. That is a clean algebraic-graph-theory argument (Lemma 2.4 + the standard intertwining of automorphisms with the Grover operator) and it guarantees the bosonic/fermionic sectors stay invariant without extra projection. They then specialise to K_n,n, use the known period-4 property of the one-particle walk on complete bipartite graphs, write the four amplitude matrices by hand, and show that ΨΨ* equals (1/|A|)I if and only if n=1 or 2 (with the precise times for n=2). The diagonal-entry calculations that kill n>2 are elementary and hold for every integer n≥2; no asymptotics or hidden spectral assumptions.\n\nWhat the paper does well is exactly that: everything is explicit, the isomorphism R is written down, the amplitude matrices at times 0–3 are displayed, and the only external input is a previously published periodicity theorem that is correctly invoked. The restriction to the single-edge initial states (4.1) is stated up front, so the claim is not oversold. Soft spots are real but proportional: the result is confined to one family of graphs and one family of initial states, the significance is therefore local to the quantum-walk community, and the discussion section only gestures at possible links with perfect state transfer. None of that undermines the theorems that are proved.\n\nThis is for people who already work on discrete-time quantum walks on graphs or who need concrete examples of resource-state generation under global interactions. The math is self-contained linear algebra plus spectral graph theory; a serious referee can verify every step by hand. I would send it to peer review without hesitation.","headline":"Clean construction of a swap-commuting two-particle Grover walk plus a sharp, hand-checkable maximality theorem for K_n,n; solid subfield math, modest scope.","tokens_in":16509,"tokens_out":520,"would_cite":false,"duration_ms":5371,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C50","81Q99"],"pacs":[],"model":"grok-4.5","headline":"Two-particle Grover walks reach maximal entanglement entropy only on K_{1,1} and K_{2,2}.","keywords":["Grover walk","entanglement entropy","Kronecker product graph","two-particle quantum walk","complete bipartite graph","swap operator","identical particles"],"falsifier":"Compute the amplitude matrices of the evolved states at times 0,1,2,3 for any n≥3 and verify that none of the associated Gram matrices equals (1/(2n^{2}))I; or exhibit a different initial state on some K_{n,n} with n>2 that does reach the bound.","tokens_in":16648,"feed_emoji":"⚛️","tokens_out":757,"duration_ms":8124,"temperature":0.7,"pith_summary":"This paper constructs a discrete-time two-particle quantum walk for identical particles on a graph G by running the ordinary one-particle Grover walk on the Kronecker product G⊗G. Because of the natural swap symmetry of that product graph, the resulting time-evolution operator automatically commutes with particle exchange, so bosonic and fermionic states stay bosonic and fermionic. Starting from a simple two-particle state that lives on a single edge (entanglement entropy only log 2), the authors ask when the walk can generate a maximally entangled state whose entropy reaches the absolute upper bound log(2|E|). For the complete bipartite graphs K_{n,n} they give a complete answer: maximality occurs if and only if n=1 or n=2. On K_{1,1} every time step is maximal; on K_{2,2} maximality appears precisely every fourth step starting at time 2. The result shows that global interactions induced by the product-graph construction can create large entanglement from almost none, but only for the smallest members of this family.","feed_headline":"Maximal entanglement only on the two smallest K_{n,n}","feed_subtitle":"Two-particle Grover walks hit the entropy ceiling if and only if n=1 or 2","key_machinery":"The two-particle time-evolution operator U defined by conjugating the one-particle Grover walk on G⊗G with the natural identification of Hilbert spaces; its commutativity with the particle-swap operator follows from the automorphism (x,y)\to(y,x) of the product graph.","core_discovery":"For the two-particle Grover walk on K_{n,n} begun from the edge-supported initial states ψ±_0 of equation (4.1), the entanglement entropy attains its upper bound log(2n^{2}) at some time if and only if n=1 or n=2. When n=1 the bound is attained at every time; when n=2 it is attained precisely when the time \tau satisfies \tau ≡ 2 (mod 4).","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Max entanglement only for n=1,2 in two-particle Grover walks on K_{n,n}","Two-particle Grover walks hit entropy bound solely when n=1 or 2","Entanglement ceiling reached iff n=1,2 for Grover walks on K_{n,n}","Full entropy only on smallest K_{n,n} for two-particle Grover evolution","Grover walks on K_{n,n} attain max entanglement exclusively at n=1,2"],"cache_read_input_tokens":128,"weakest_assumption_plain":"The exhaustive case analysis relies on starting from one particular pair of edge-supported states and on the fact that the Grover walk on complete bipartite graphs is exactly four-periodic; if either fails, maximality is no longer decided by checking only times 0 through 3.","fun_headline_variants_meta":{"raw":{"variants":["Max entanglement only for n=1,2 in two-particle Grover walks on K_{n,n}","Two-particle Grover walks hit entropy bound solely when n=1 or 2","Entanglement ceiling reached iff n=1,2 for Grover walks on K_{n,n}","Full entropy only on smallest K_{n,n} for two-particle Grover evolution","Grover walks on K_{n,n} attain max entanglement exclusively at n=1,2"]},"model":"grok-4.5","effort":"low","cost_usd":0.005094,"raw_usage":{"total_tokens":1405,"prompt_tokens":738,"num_sources_used":0,"completion_tokens":125,"cost_in_usd_ticks":50940000,"prompt_tokens_details":{"text_tokens":738,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":542,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":738,"tokens_out":125,"duration_ms":5713,"temperature":1.0,"reasoning_tokens":542,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-13T00:35:14.922373+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Compute the amplitude matrices of the evolved states at times 0,1,2,3 for any n≥3 and verify that none of the associated Gram matrices equals (1/(2n^{2}))I; or exhibit a different initial state on some K_{n,n} with n>2 that does reach the bound.","supporting_citations":[],"review_version":1}