Pith. sign in

REVIEW 4 minor 1 cited by

Entanglement entropy in two-particle Grover walks on graphs

T0 review · 0 major / 4 minor · reviewed 2026-07-13 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Two-particle Grover walks reach maximal entanglement entropy only on K_{1,1} and K_{2,2}.

desk verdict 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. read the letter →

arxiv 2607.09066 v1 pith:RRETULXP submitted 2026-07-10 quant-ph

Sho Kubota , Haruhiko Matsubara , Etsuo Segawa This is my paper · ORCID
classification quant-ph MSC 05C5081Q99
keywords GroverwalkentanglemententropyKroneckerproductgraphtwo-particlequantumcompletebipartiteswapoperatoridenticalparticles
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

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.

What carries the argument

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) o(y,x) of the product graph.

What would settle it

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.

Watch

Extended reading notes

Core claim

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 au satisfies au ≡ 2 (mod 4).

Load-bearing premise

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.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 4 minor

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 au ≡ 2 mod 4). The classification is therefore exhaustive for the chosen initial data.

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.

minor comments (4)
  1. 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.
  2. 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.
  3. 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}.
  4. 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.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the maximality classification is an exhaustive, self-contained computation on a 4-periodic walk.

full rationale

The paper defines the two-particle Grover walk by transporting the ordinary one-particle Grover walk on G⊗G via the natural isomorphism R (eq. 3.2). Commutation with the swap operator (Theorem 1.1/3.2) follows from the elementary automorphism (x,y)↦(y,x) of G⊗G together with the known fact that automorphisms of a graph commute with its Grover operator (Lemma 2.3, cited from independent prior work). The entanglement-entropy upper bound is the standard von Neumann criterion (Corollary 3.4). For K_{n,n} the walk is 4-periodic by the external spectral result of Higuchi et al. (invoked via Lemma 4.1); the four states are written out explicitly (Lemma 4.2 and the subsequent calculation of au=3), and maximality is decided by checking whether the (x1,y1)-diagonal entry of ΨΨ* equals 1/(2n^{2}). The resulting algebraic identities hold for all integers n≥2 and force n=1,2 only. No parameter is fitted, no uniqueness theorem is imported from the authors’ own work, and no ansatz is smuggled in. The derivation is therefore closed and non-circular.

Assumptions & free parameters 0 free parameters · 3 assumptions · 1 invented entities

The paper rests on standard definitions of the Grover walk, the Kronecker product of graphs, and the von Neumann entanglement entropy, plus the quantum-mechanical requirement that identical-particle states be eigenvectors of the swap. No free parameters are fitted; the only external non-standard input is the known 4-periodicity of the Grover walk on complete bipartite graphs.

assumptions (3)
  • domain assumption The time-evolution operator of a system of identical particles must commute with the swap operator that exchanges particle labels.
    Invoked in the introduction and proved for the constructed walk in Theorem 1.1 / Theorem 3.2; taken from standard quantum mechanics (Sakurai).
  • domain assumption The one-particle Grover walk on a complete bipartite graph with at least three vertices is exactly 4-periodic.
    Cited as Theorem 1.3 of Higuchi et al. (2017) and used via Lemma 4.1 to reduce the entropy calculation to times 0–3.
  • standard math Entanglement entropy of a pure bipartite state is the von Neumann entropy of either reduced density matrix, equivalently -∑ λ log λ over eigenvalues of ΨΨ*.
    Standard definition (Nielsen–Chuang); used throughout Section 3.2 and Corollary 3.4.
invented entities (1)
  • two-particle Grover walk on G
    purpose: Provides a unitary evolution on the two-particle Hilbert space that incorporates global interactions via the Kronecker product while automatically preserving exchange symmetry.
    Defined by U := R^{-1} U(G⊗G) R in equation (3.2); the central object of study.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Entanglement entropy in two-particle Grover walks on graphs." pith.science (2026). https://pith.science/paper/RRETULXP

@misc{pith2026260709066,
  author       = {Pith},
  title        = {Pith review of: Entanglement entropy in two-particle Grover walks on graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RRETULXP}},
  note         = {Machine review of arXiv:2607.09066}
}
abstract

We define a two-particle quantum walk of identical particles on a graph $G$ via the one-particle Grover walk on the Kronecker product $G \otimes G$, and call it the two-particle Grover walk. In systems of identical particles, quantum mechanics requires that quantum states have a certain invariance with respect to the exchange of particles. Focusing on the symmetry of the Kronecker product $G \otimes G$ as a graph, we show that the time evolution operator of this walk commutes with the swap operator, which ensures that this requirement is satisfied. Furthermore, we study the entanglement entropy of quantum states evolved by this walk. For the complete bipartite graph $K_{n,n}$, we completely determine the values of $n$ for which the quantum states evolved from specific initial states attain the upper bound of the entropy at some time, and prove that they are exactly $1$ and $2$.

Figures

Figures reproduced from arXiv: 2607.09066 by the authors.

Figure 1
Figure 1. The complete bipartite graph K2,3 2.1 One-particle Grover walks on graphs We first introduce the Grover walk on a graph. The Grover walk discussed here is the Grover walk as a one-particle system. This walk is also referred to as the arc-reversal walk or the arc-reversal Grover walk. Let G = (V, E) be a graph. Define A = A(G) := {(x, y),(y, x) | {x, y} ∈ E}, which is the set of the symmetric arcs of G. The origin x … view at source ↗
Figure 2
Figure 2. The action of U: Each blue arrow represents the standard basis vector labeled by the corresponding arc. The left and right figures represent the before and after states of the action U, respectively. We omit depicting arrows of corresponding arcs returning the value 0 of the states. y U∗ 7→ 2 deg y − 1 2 deg y 2 deg y 2 deg y y [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. The action of U ∗ : The action U ∗ is given by flipping the direction of every arrow in before and after states of the action U. 2.2 Additional material on algebraic graph theory Let G = (V, E) be a graph. A mapping g : V → V is an automorphism of G if g is bijective, and {x, y} ∈ E if and only if {g(x), g(y)} ∈ E. We denote the set of all automorphisms of G by Aut(G). Let g be an automorphism of a graph G, and let … view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Robustness of periodicity in Grover walks under a magnetic vector potential

    quant-ph 2026-07 conditional novelty 6.0 of 10

    A small magnetic vector potential on one edge of a periodic Grover walk produces a first-order correction described by a Hermitian matrix H, and the discrete walk converges to a continuous-time quantum walk generated by τH.

Reference graph

Works this paper leans on

24 extracted references · 1 linked inside Pith · cited by 1 Pith paper

  1. [1]

    Ahlbrecht, A

    A. Ahlbrecht, A. Alberti, D. Meschede, V. B. Scholz, A. H. Werner, and R. F. Werner. Molecular binding in interacting quantum walks.New Journal of Physics, 14(7):073050, 2012

    2012

  2. [2]

    S. D. Berry and J. B. Wang. Two-particle quantum walks: Entanglement and graph isomorphism testing.Physical Review A—Atomic, Molecular, and Optical Physics, 83(4):042317, 2011

    2011

  3. [3]

    A. E. Brouwer and W. H. Haemers.Spectra of graphs. Springer Science & Business Media, 2011

    2011

  4. [4]

    G. R. Carson, T. Loke, and J. B. Wang. Entanglement dynamics of two-particle quantum walks.Quantum Information Processing, 14(9):3193–3210, 2015

    2015

  5. [5]

    Chandrashekar and T

    C.M. Chandrashekar and T. Busch. Quantum walk on distinguishable non-interacting many-particles and indistinguishable two-particle.Quantum Information Processing, 11(5):1287–1299, 2012

    2012

  6. [6]

    Cheng and B

    B. Cheng and B. Liu. On the nullity of graphs.The Electronic Journal of Linear Algebra, 16:60–67, 2007

    2007

  7. [7]

    J. K. Gamble, M. Friesen, D. Zhou, R. Joynt, and S. N. Coppersmith. Two-particle quan- tum walks applied to the graph isomorphism problem.arXiv preprint arXiv:1002.3003, 2010

    arXiv 2010

  8. [8]

    Godsil and G

    C. Godsil and G. Royle.Algebraic graph theory, volume 207. Springer Science & Business Media, 2013

    2013

Show all 24 references
  1. [9]

    S. K. Goyal and C. M. Chandrashekar. Spatial entanglement using a quantum walk on a many-body system.Journal of Physics A: Mathematical and Theoretical, 43(23):235303, 2010. 17

    2010

  2. [10]

    Higuchi, N

    Y. Higuchi, N. Konno, I. Sato, and E. Segawa. Periodicity of the discrete-time quantum walk on a finite graph.Interdisciplinary Information Sciences, 23(1):75–86, 2017

    2017

  3. [11]

    Kubota and E

    S. Kubota and E. Segawa. Perfect state transfer in grover walks between states associated to vertices of a graph.Linear Algebra and its Applications, 646:238–251, 2022

    2022

  4. [12]

    Kubota, E

    S. Kubota, E. Segawa, and T. Taniguchi. Quantum walks defined by digraphs and generalized hermitian adjacency matrices.Quantum Information Processing, 20(3):95, 2021

    2021

  5. [13]

    Kubota, H

    S. Kubota, H. Sekido, and H. Yata. Periodicity of quantum walks defined by mixed paths and mixed cycles.Linear Algebra and its Applications, 630:15–38, 2021

    2021

  6. [14]

    Kubota, H

    S. Kubota, H. Sekido, H. Yata, and K. Yoshino. Strongly regular and strongly walk- regular graphs that admit perfect state transfer.arXiv preprint arXiv:2506.02530, 2025

    2025

  7. [15]

    Kubota and K

    S. Kubota and K. Yoshino. Circulant graphs with valency up to 4 that admit perfect state transfer in grover walks.Journal of Combinatorial Theory, Series A, 216:106064, 2025

    2025

  8. [16]

    N. B. Lovett, S. Cooper, M. Everitt, M. Trevers, and V. Kendon. Universal quantum computation using the discrete-time quantum walk.Physical Review A—Atomic, Molec- ular, and Optical Physics, 81(4):042330, 2010

    2010

  9. [17]

    M. A. Nielsen and I. L. Chuang.Quantum computation and quantum information. Cam- bridge university press, 2010

    2010

  10. [18]

    Nishioka

    T. Nishioka. Entanglement entropy: holography and renormalization group.Reviews of Modern Physics, 90(3):035007, 2018

    2018

  11. [19]

    Y. Omar, N. Paunkovi´ c, L. Sheridan, and S. Bose. Quantum walk on a line with two entangled particles.Physical Review A—Atomic, Molecular, and Optical Physics, 74(4):042304, 2006

    2006

  12. [20]

    Par` yzkov´ a, M.ˇStefaˇ n´ ak, J

    M. Par` yzkov´ a, M.ˇStefaˇ n´ ak, J. Novotn` y, B. Koll´ ar, and T. Kiss. Two-particle hadamard walk on dynamically percolated line and circle.Physica Scripta, 99(3):035112, 2024

    2024

  13. [21]

    Portugal.Quantum walks and search algorithms, volume 19

    R. Portugal.Quantum walks and search algorithms, volume 19. Springer, 2013

    2013

  14. [22]

    Qiang, S

    X. Qiang, S. Ma, and H. Song. Quantum walk computing: Theory, implementation, and application.Intelligent Computing, 3:0097, 2024

    2024

  15. [23]

    Rudinger, J

    K. Rudinger, J. K. Gamble, E. Bach, M. Friesen, R. Joynt, and S. N. Coppersmith. Com- paring algorithms for graph isomorphism using discrete-and continuous-time quantum random walks.Journal of Computational and Theoretical Nanoscience, 10(7):1653–1661, 2013

    2013

  16. [24]

    J. J. Sakurai and J. Napolitano.Modern quantum mechanics. Cambridge university press, 2020. 18

    2020

Pith tools

Reviewed July 13, 2026 · model on record in the stance chip above.