Hamiltonians of Bipartite Walks

In this paper, we introduce a discrete quantum walk model called bipartite walks. Bipartite walks include many known discrete quantum walk models, like Grover’s walks, vertex-face walks. For the transition matrix of a quantum walk, there is a Hamiltonian associated with it. We will study the Hamiltonians of the bipartite walks. Let $S$ be a skew-symmetric matrix. We are mainly interested in the Hamiltonians of the form $iS$. We show that the Hamiltonian can be written as $iS$ if and only if the adjacency matrix of the bipartite graph is invertible. We show that Grover’s walks and vertex-face walks are special cases of bipartite walks. Via the Hamiltonians, phenomena of bipartite walks lead to phenomena of continuous walks. We show in detail how we use bipartite walks on paths to construct universal perfect state transfer in continuous walks.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2024-10-03
DOI
https://doi.org/10.37236/12040
Citations
2
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
2.02
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hamiltonians of Bipartite Walks

Mariia Sobchuk, Qiuting Chen, Chris Godsil, Hanmeng Zhan
2 citations
The Electronic Journal of Combinatorics
Graph theory and applications
2.02
article

Hamiltonians of Bipartite Walks

Mariia Sobchuk, Qiuting Chen, Chris Godsil, Hanmeng Zhan
article en
2 citations

Abstract

In this paper, we introduce a discrete quantum walk model called bipartite walks. Bipartite walks include many known discrete quantum walk models, like Grover’s walks, vertex-face walks. For the transition matrix of a quantum walk, there is a Hamiltonian associated with it. We will study the Hamiltonians of the bipartite walks. Let $S$ be a skew-symmetric matrix. We are mainly interested in the Hamiltonians of the form $iS$. We show that the Hamiltonian can be written as $iS$ if and only if the adjacency matrix of the bipartite graph is invertible. We show that Grover’s walks and vertex-face walks are special cases of bipartite walks. Via the Hamiltonians, phenomena of bipartite walks lead to phenomena of continuous walks. We show in detail how we use bipartite walks on paths to construct universal perfect state transfer in continuous walks.

The Electronic Journal of CombinatoricsVol. 31(4)
University of Waterloo (CA)
Openalex Percentile: Top 14%
Graph theory and applications
2.02
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.