Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.02254

Perfect state transfer in Grover walks on dihedral Cayley graphs

Koushik Bhakta·Bikash Bhattacharjya·Xiwang Cao
View original source ↗Read source document ↗Export metadata ↓

Abstract

The paper investigates perfect state transfer (PST) in Grover walks on Cayley graphs over the dihedral group $D_n$. The Grover walk is a discrete-time quantum walk widely studied in quantum information processing. A Cayley graph $\operatorname{Cay}(Γ,S)$ is called normal if $S$ is the union of some conjugacy classes of the group $Γ$; otherwise, it is called non-normal. Most existing studies have been restricted to Cayley graphs over abelian groups. In contrast, we investigate both normal and non-normal cases for Cayley graphs over the non-abelian group $D_n$. By examining the parity of $n$ and the normality of the Cayley graph, we obtain a complete characterization of PST on $\operatorname{Cay}(D_n,S)$. In particular, we establish necessary and sufficient conditions for the occurrence of PST in all possible cases, and prove that PST does not occur for normal Cayley graphs when $n$ is odd. Furthermore, we construct several infinite families of normal and non-normal Cayley graphs $\operatorname{Cay}(D_n,S)$ that exhibit PST, illustrating the application of the main result. Our approach is based on the representation theory of the dihedral group.

Explore related subjects

math.COquant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Koushik Bhakta, Bikash Bhattacharjya, Xiwang Cao. 2026-05-04. Perfect state transfer in Grover walks on dihedral Cayley graphs. https://arxiv.org/abs/2605.02254

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗