Papers
Topics
Authors
Recent
Search
2000 character limit reached

Perfect State Transfer on Abelian Cayley Graphs

Published 26 Dec 2017 in quant-ph and math.CO | (1712.09260v1)

Abstract: Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this paper we present a characterization on connected simple Cayley graph $\Gamma={\rm Cay}(G,S)$ having PST. We show that many previous results on periodicity and existence of PST of circulant graphs (where the underlying group $G$ is cyclic) and cubelike graphs ($G=(\mathbb{F}_2n,+)$) can be derived or generalized to arbitrary abelian case in unified and more simple ways from our characterization. We also get several new results including answers on some problems raised before.

Citations (39)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.