Let GG be a graph with adjacency matrix AA. The transition matrix of GG relative to AA is defined by HA(t)≔exp(−itA),t∈R. We say that the graph GG admits perfect state transfer between the vertices uu and vv at τ∈Rτ∈R if the uvuvth entry of HA(τ)HA(τ) has unit modulus. Perfect state transfer is a rare phenomenon 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 does 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 uu to two different vertices vv and ww.