Laplacian quantum walks on blow-up graphs

This paper is a sequel to the work of Bhattacharjya et al. (2024) [2] on quantum state transfer on blow-up graphs, where instead of the adjacency matrix, we take the Laplacian matrix as the time-independent Hamiltonian associated with a blow-up graph. We characterize Laplacian strong cospectrality, periodicity, perfect state transfer (LPST) and pretty good state transfer (LPGST) on blow-up graphs. We present several constructions of blow-up graphs with LPST and produce new infinite families of regular graphs where each vertex is involved in LPST. We also determine LPST and LPGST in blow-ups of classes of trees. Finally, if n ≡ 0 (mod 4), then the blow-up of n copies of a graph has no LPST, but we show that under certain conditions, the addition of an appropriate matching to this blow-up graph results in LPST.

Authors

Publication Details

Journal
Linear Algebra and its Applications
Published
2025-10-01
DOI
https://doi.org/10.1016/j.laa.2025.10.001
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Laplacian quantum walks on blow-up graphs

Hiranmoy Pal, Steve Kirkland
1 citations
Linear Algebra and its Applications
Quantum Computing Algorithms and Architecture
2.48
article

Laplacian quantum walks on blow-up graphs

Hiranmoy Pal, Steve Kirkland
article en
1 citations

Abstract

This paper is a sequel to the work of Bhattacharjya et al. (2024) [2] on quantum state transfer on blow-up graphs, where instead of the adjacency matrix, we take the Laplacian matrix as the time-independent Hamiltonian associated with a blow-up graph. We characterize Laplacian strong cospectrality, periodicity, perfect state transfer (LPST) and pretty good state transfer (LPGST) on blow-up graphs. We present several constructions of blow-up graphs with LPST and produce new infinite families of regular graphs where each vertex is involved in LPST. We also determine LPST and LPGST in blow-ups of classes of trees. Finally, if n ≡ 0 (mod 4), then the blow-up of n copies of a graph has no LPST, but we show that under certain conditions, the addition of an appropriate matching to this blow-up graph results in LPST.

Linear Algebra and its Applications
Openalex Percentile: Top 8%
Quantum Computing Algorithms and Architecture
2.48
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.