English

Pair State Transfer

Combinatorics 2020-09-07 v3 Mathematical Physics math.MP Quantum Physics

Abstract

Let LL denote the Laplacian matrix of a graph GG. We study continuous quantum walks on GG defined by the transition matrix U(t)=exp(itL)U(t)=\exp\left(itL\right). The initial state is of the pair state form, eaebe_a-e_b with a,ba,b being any two vertices of GG. We provide two ways to construct infinite families of graphs that have perfect pair transfer. We study a "transitivity" phenomenon which cannot occur in vertex state transfer. We characterize perfect pair state transfer on paths and cycles. We also study the case when quantum walks are generated by the unsigned Laplacians of underlying graphs and the initial states are of the plus state form, ea+ebe_a+e_b. When the underlying graphs are bipartite, plus state transfer is equivalent to pair state transfer.

Cite

@article{arxiv.1906.01591,
  title  = {Pair State Transfer},
  author = {Qiuting Chen and Chris Godsil},
  journal= {arXiv preprint arXiv:1906.01591},
  year   = {2020}
}
R2 v1 2026-06-23T09:41:49.863Z