Perfect state transfer in NEPS of complete graphs

Yipeng Li; Xiaogang Liu; Shenggui Zhang; Sanming Zhou

doi:10.1016/j.dam.2020.09.024

Perfect state transfer in NEPS of complete graphs

Yipeng Li, Xiaogang Liu, Shenggui Zhang, Sanming Zhou

数学与统计学院

科研成果: 期刊稿件 › 文章 › 同行评审

15 引用（Scopus）

摘要

Perfect state transfer in graphs is a concept arising from quantum physics and quantum computing. Given a graph G with adjacency matrix A_G, the transition matrix of G with respect to A_G is defined as H_{A_G}(t)=exp(−itA_G), 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 H_{A_G}(τ) is equal to 1. If the moduli of all diagonal entries of H_{A_G}(τ) 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.

源语言	英语
页（从-至）	98-114
页数	17
期刊	Discrete Applied Mathematics
卷	289
DOI	https://doi.org/10.1016/j.dam.2020.09.024
出版状态	已出版 - 31 1月 2021

访问文件

10.1016/j.dam.2020.09.024

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{25b43fd0407146eeb09907d55bb8c27a,

title = "Perfect state transfer in NEPS of complete graphs",

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.",

keywords = "NEPS, Perfect state transfer, Periodic, Transition matrix",

author = "Yipeng Li and Xiaogang Liu and Shenggui Zhang and Sanming Zhou",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2021",

month = jan,

day = "31",

doi = "10.1016/j.dam.2020.09.024",

language = "英语",

volume = "289",

pages = "98--114",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Perfect state transfer in NEPS of complete graphs

AU - Li, Yipeng

AU - Liu, Xiaogang

AU - Zhang, Shenggui

AU - Zhou, Sanming

PY - 2021/1/31

Y1 - 2021/1/31

N2 - 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.

AB - 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.

KW - NEPS

KW - Perfect state transfer

KW - Periodic

KW - Transition matrix

UR - http://www.scopus.com/inward/record.url?scp=85092453084&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2020.09.024

DO - 10.1016/j.dam.2020.09.024

M3 - 文章

AN - SCOPUS:85092453084

SN - 0166-218X

VL - 289

SP - 98

EP - 114

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Perfect state transfer in NEPS of complete graphs

摘要

访问文件

其它文件与链接

指纹

引用此