Search arXivSearch

arXiv · 2504.11585

Laplacian quantum walks on blow-up graphs

Abstract

This paper is a sequel to the work of Bhattacharjya et al.\ (J. Phys. A-Math. 57.33: 335303, https://doi.org/10.1088/1751-8121/ad6653) 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 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\equiv 0$ (mod 4), then the blow-up of $n$ copies of a graph $G$ has no LPST, but we show that under certain conditions, the addition of an appropriate matching this blow-up graph results in LPST.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hermie Monterde, Hiranmoy Pal, Steve Kirkland. 2025-04-15. Laplacian quantum walks on blow-up graphs. https://arxiv.org/abs/2504.11585

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO