Entanglement entropy in two-particle Grover walks on graphs
quant-ph
Submitted: 2026-07-10
Updated: 2026-11-02
Comments: 21 pages, 3 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: 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 times G, and call it the two-particle Grover walk.
Terminology
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 times 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 times 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.
Sources
- Two-particle quantum walks applied to the graph isomorphism problem
- Strongly regular and strongly walk-regular graphs that admit perfect state transfer
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements