Perfect State Transfer on NEPS of the path P3
Abstract
Perfect state transfer is significant in quantum communication networks. There are very few graphs having this property. So, it is useful to find some new graphs having perfect state transfer. A good way to construct new graphs is by forming NEPS. It is known that the graph P3 exhibits perfect state transfer and so we investigate some NEPS of the path P3. A sufficient condition is found for a NEPS of P3 to have perfect state transfer. Using these NEPS, some other graphs are constructed having perfect state transfer. We also prove that for every n∈ 1 and any odd positive integer k< n, there is a basis such that NEPS(P3,…, P3;) is connected and exhibits perfect state transfer.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.