Pretty good fractional revival on abelian Cayley graphs

Let $Γ$ be a graph with the adjacency matrix $A$. The transition matrix of $Γ$, denoted $H(t)$, is defined as $H(t) := \exp(-\textbf{i}tA)$, where $\textbf{i} := \sqrt{-1}$ and $t$ is a real variable. The graph $Γ$ is said to exhibit fractional revival (FR in short) between the vertices $a$ and $b$ if there exists a positive real number $t$ such that $H(t){\textbf{e}_{a}} = α{\textbf{e}_{a}} + β{\textbf{e}_{b}}$, where $α, β\in \mathbb{C}$ such that $β\neq 0$ and $|α|^2 + |β|^2 = 1$. The graph $Γ$ is said to exhibit pretty good fractional revival (PGFR in short) between the vertices $a$ and $b$ if there exists a sequence of real numbers $\{t_k\}$ with $\lim_{k\to\infty} H(t_k){\textbf{e}_{a}} = α{\textbf{e}_{a}} + β{\textbf{e}_{b}}$, where $α, β\in \mathbb{C}$ such that $β\neq 0$ and $|α|^2 + |β|^2 = 1$. In the definition of PGFR, if $α=0$ then $Γ$ is said to exhibit pretty good state transfer (PGST in short) between $a$ and $b$. In this paper, we obtain some sufficient conditions for circulant graphs exhibiting PGFR. We also find some sufficient conditions for non-circulant abelian Cayley graphs exhibiting PGFR. From these sufficient conditions, we find infinite families of circulant graphs and non-circulant abelian Cayley graphs exhibiting PGFR that fail to exhibit FR and PGST. Finally, we obtain some necessary conditions for some families of circulant graphs exhibiting PGFR. Some of our results generalize the results of Chan et al. [Pretty good quantum fractional revival in paths and cycles. \textit {Algebr. Comb.} 4(6) (2021), 989-1004.] for cycles.

Publication Details

Journal
ArXiv.org
Published
2025-03-26
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Pretty good fractional revival on abelian Cayley graphs

ArXiv.org
Quantum Computing Algorithms and Architecture
article

Pretty good fractional revival on abelian Cayley graphs

article en

Abstract

Let $Γ$ be a graph with the adjacency matrix $A$. The transition matrix of $Γ$, denoted $H(t)$, is defined as $H(t) := \exp(-\textbf{i}tA)$, where $\textbf{i} := \sqrt{-1}$ and $t$ is a real variable. The graph $Γ$ is said to exhibit fractional revival (FR in short) between the vertices $a$ and $b$ if there exists a positive real number $t$ such that $H(t){\textbf{e}_{a}} = α{\textbf{e}_{a}} + β{\textbf{e}_{b}}$, where $α, β\in \mathbb{C}$ such that $β\neq 0$ and $|α|^2 + |β|^2 = 1$. The graph $Γ$ is said to exhibit pretty good fractional revival (PGFR in short) between the vertices $a$ and $b$ if there exists a sequence of real numbers $\{t_k\}$ with $\lim_{k\to\infty} H(t_k){\textbf{e}_{a}} = α{\textbf{e}_{a}} + β{\textbf{e}_{b}}$, where $α, β\in \mathbb{C}$ such that $β\neq 0$ and $|α|^2 + |β|^2 = 1$. In the definition of PGFR, if $α=0$ then $Γ$ is said to exhibit pretty good state transfer (PGST in short) between $a$ and $b$. In this paper, we obtain some sufficient conditions for circulant graphs exhibiting PGFR. We also find some sufficient conditions for non-circulant abelian Cayley graphs exhibiting PGFR. From these sufficient conditions, we find infinite families of circulant graphs and non-circulant abelian Cayley graphs exhibiting PGFR that fail to exhibit FR and PGST. Finally, we obtain some necessary conditions for some families of circulant graphs exhibiting PGFR. Some of our results generalize the results of Chan et al. [Pretty good quantum fractional revival in paths and cycles. \textit {Algebr. Comb.} 4(6) (2021), 989-1004.] for cycles.

ArXiv.org
Openalex Percentile: Top 73%
Quantum Computing Algorithms and Architecture
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.