Perfect quantum state transfer on the Johnson scheme

For any graph X with the adjacency matrix A, the transition matrix of the continuous-time quantum walk at time t is given by the matrix-valued function HX(t)=eitA. We say that there is perfect state transfer in X from the vertex u to the vertex v at time τ if |HX(τ)u,v|=1. It is an important problem...

Full description

Saved in:
Bibliographic Details
Published in:Linear algebra and its applications 2020-01, Vol.584, p.326-342
Main Authors: Ahmadi, Bahman, Shirdareh Haghighi, M.H., Mokhtar, Ahmad
Format: Article
Language:English
Subjects:
Association scheme
Graphs
Johnson scheme
Linear algebra
Perfect state transfer
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For any graph X with the adjacency matrix A, the transition matrix of the continuous-time quantum walk at time t is given by the matrix-valued function HX(t)=eitA. We say that there is perfect state transfer in X from the vertex u to the vertex v at time τ if |HX(τ)u,v|=1. It is an important problem to determine whether perfect state transfers can happen on a given family of graphs. In this paper we characterize all the graphs in the Johnson scheme which have this property. Indeed, we show that the Kneser graph K(2k,k) is the only class in the scheme which admits perfect state transfers. We also show that, under some conditions, some of the unions of the graphs in the Johnson scheme admit perfect state transfer.
ISSN:0024-3795
1873-1856
DOI:10.1016/j.laa.2019.09.021