Perfect state transfer in NEPS of complete graphs

Publication date 29 December 2020

Abstract: 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) = e x p (- m a t h r m i t A_{G})

,

t i n m a t h b b R, m a t h r m i = s q r t - 1

. We say that perfect state transfer from vertex

u

to vertex

v

occurs in

G

at time

a u

if

u e v

and the modulus of the

(u, v)

-entry of

H_{A_{G}} (a u)

is equal to

1

. If the moduli of all diagonal entries of

H_{A_{G}} (a u)

are equal to

1

for some

a u

, then

G

is called periodic with period

a u

. In this paper we give a few sufficient conditions for NEPS of complete graphs to be periodic or exhibit perfect state transfer.

Recommendations

Cites work

Cited in

(19)

This page was built for publication: Perfect state transfer in NEPS of complete graphs