  Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$
relative to $A$ is defined by $H_{A}(t):=\exp{(-itA)},\;t\in\Rl$. We say that
the graph $G$ admits perfect state transfer between the verteices $u$ and $v$
at $\tau\in\Rl$ if the $uv$-th entry of $H_{A}(\tau)$ has unit modulus. Perfect
state transfer is a rare phenomena so we consider an approximation called
pretty good state transfer. We find that NEPS (Non-complete Extended P-Sum) of
the path on three vertices with basis containing tuples with hamming weights of
both parities do not exhibit perfect state transfer. But these NEPS admit
pretty good state transfer with an additional condition. Further we investigate
pretty good state transfer on Cartesian product of graphs and we find that a
graph can have PGST from a vertex $u$ to two different vertices $v$ and $w$.
