Perfect state transfer in NEPS of complete graphs

Yipeng Li, Xiaogang Liu, Shenggui Zhang, Sanming Zhou

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

Perfect state transfer in graphs is a concept arising from quantum physics and quantum computing. Given a graph G with adjacency matrix AG, the transition matrix of G with respect to AG is defined as HAG(t)=exp(−itAG), t∈R,i=−1. We say that perfect state transfer from vertex u to vertex v occurs in G at time τ if u≠v and the modulus of the (u,v)-entry of HAG(τ) is equal to 1. If the moduli of all diagonal entries of HAG(τ) are equal to 1 for some τ, then G is called periodic with period τ. In this paper we give a few sufficient conditions for NEPS of complete graphs to be periodic or exhibit perfect state transfer.

Original languageEnglish
Pages (from-to)98-114
Number of pages17
JournalDiscrete Applied Mathematics
Volume289
DOIs
StatePublished - 31 Jan 2021

Keywords

  • NEPS
  • Perfect state transfer
  • Periodic
  • Transition matrix

Fingerprint

Dive into the research topics of 'Perfect state transfer in NEPS of complete graphs'. Together they form a unique fingerprint.

Cite this