Quantum walks and graph operations

Let $U_X(t)$ be the transition matrix of a quantum walk on a graph $X$ relative to its adjacency matrix $A$ or the Laplacian matrix $L$. This paper investigates the behavior of quantum walks under Cartesian products, joins, and graph complements. We have two main goals. First, we characterize the conditions such that peak state transfer and pretty good state transfer are preserved under these operations, allowing us to construct new families of graphs admitting these properties. Our second goal is to analyze the relationship between the quantum walks on a graph and its complement. We provide bounds for $f_{u,v}(t)=\mid U_{X^c}(t{)}_{u,v}-e^{it\delta }{U}_X(-t{)}_{u,v}\mid$ and $g_{u,v}(t)=\mid \mathrm{\mid }{U}_X(t{)}_{u,v}\mathrm{\mid }-\mathrm{\mid }{U}_{X^c}(t{)}_{u,v}\mathrm{\mid }\mid$, where $\delta =-1$ when dealing with $A$ and $\delta =n$ otherwise. Note that $f_{u,v}(t)$ and $g_{u,v}(t)$ both measure the difference between the behavior of quantum state transfer between vertices $u$ and $v$ in a graph and its complement. If $X$ is regular or $M=L$, then $f_{u,v}(t)$ is bounded above by $\frac{2}{\mathrm{\mid }V(X)\mathrm{\mid }}$. If $X$ is non-regular and $M=A$, then we utilize the main eigenvalues of a graph to obtain an upper bound for $f_{u,v}(t)$ which depends only on $A$. We also use the bounding matrix of the graph to give bounds for the Nordhaus-Gaddum type relations $\mathrm{\mid }{U}_X(t{)}_{u,v}\mathrm{\mid }+\mathrm{\mid }{U}_{X^c}(t{)}_{u,v}\mathrm{\mid }$ and $\mathrm{\mid }{U}_X(t{)}_{u,v}\mathrm{\mid }\cdot \mathrm{\mid }{U}_{X^c}(t{)}_{u,v}\mathrm{\mid }$. Finally, we demonstrate that most of our bounds are sharp for certain families of graphs.