Entanglement entropy in two-particle Grover walks on graphs

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 ⊗ 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 ⊗ 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.

Authors

Institutions

Publication Details

Journal
Journal of Physics A Mathematical and Theoretical
Published
2026-10-30
DOI
https://doi.org/10.1088/1751-8121/aebc2a
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Entanglement entropy in two-particle Grover walks on graphs

Etsuo Segawa, Sho Kubota, Haruhiko Matsubara
Journal of Physics A Mathematical and Theoretical
Quantum Computing Algorithms and Architecture
article

Entanglement entropy in two-particle Grover walks on graphs

Etsuo Segawa, Sho Kubota, Haruhiko Matsubara
article en

Abstract

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 ⊗ 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 ⊗ 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.

Journal of Physics A Mathematical and Theoretical
Osaka Kyoiku University (JP), Yokohama National University (JP), Aichi University of Education (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 52%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon