Perfect State Transfer on gcd-graphs

@inproceedings{Pal2016PerfectST,
  title={Perfect State Transfer on gcd-graphs},
  author={Hiranmoy Pal and Bikash Bhattacharjya},
  year={2016}
}
Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ is denoted by $H(t)$ and it is defined by $H(t):=\exp{\left(itA\right)},\;t\in\mathbb{R}.$ The graph $G$ has perfect state transfer (PST) from a vertex $u$ to another vertex $v$ if there exist $\tau\left(\neq0\right)\in\mathbb{R}$ such that the $uv$-th entry of $H(\tau)$ has unit modulus. In case when $u=v$, we say that $G$ is periodic at the vertex $u$ at time $\tau$. The graph $G$ is said to be periodic if it is… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

GCD-graphs and NEPS of complete graphs

  • Ars Math. Contemp.
  • 2012
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

State transfer on graphs

  • Discrete Mathematics
  • 2011
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Perfect state transfer is poly-time

  • Quantum Information & Computation
  • 2016
VIEW 1 EXCERPT

Periodic graphs , Electron

B. Bhattacharjya Pal
  • 2012

Application of graph spectra in quantum physics

D. Stevanović
  • in: D. Cevtković, I. Gutman (Eds.), Selected Topics on Applications of Graph Spectra, Zbornik radova 14(22), Mathematical Institute SANU, Belgrade, pp. 85-111
  • 2011
VIEW 1 EXCERPT