Perfect state transfer on weighted graphs of the Johnson scheme

Abstract: We characterize perfect state transfer on real-weighted graphs of the Johnson scheme

m a t h c a l J (n, k)

. Given

m a t h c a l J (n, k) = A_{1}, A_{2}, c d o t s, A_{k}

and

A (X) = w_{0} A_{0} + c d o t s + w_{m} A_{m}

, we show, using classical number theory results, that

X

has perfect state transfer at time

a u

if and only if

n = 2 k

,

m g e 2^{l f l o o r l o g_{2} (k) f l o o r}

, and there are integers

c_{1}, c_{2}, c d o t s, c_{m}

such that (i)

c_{j}

is odd if and only if

j

is a power of

2

, and (ii) for

r = 1, 2, c d o t s, m

, [w_r = frac{pi}{ au} sum_{j=r}^m frac{c_j}{�inom{2j}{j}} �inom{k-r}{j-r}.] We then characterize perfect state transfer on unweighted graphs of

m a t h c a l J (n, k)

. In particular, we obtain a simple construction that generates all graphs of

m a t h c a l J (n, k)

with perfect state transfer at time

p i / 2

.

Recommendations

Cites Work

Cited In (3)

This page was built for publication: Perfect state transfer on weighted graphs of the Johnson scheme