Quantum state transfer on integral oriented circulant graphs
Xing-Kun Song

TL;DR
This paper investigates perfect and multiple quantum state transfer on integral oriented circulant graphs, providing characterizations and counting formulas for such graphs with these properties.
Contribution
It offers the first characterization of perfect and multiple state transfer on integral oriented circulant graphs and derives formulas for counting these graphs.
Findings
Characterization of PST and MST on integral oriented circulant graphs
Closed-form expression for counting such graphs with PST or MST
Identification of conditions for integral oriented circulant graphs to have PST or MST
Abstract
An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer ( for short) and multiple state transfer ( for short) on integral oriented circulant graphs. Specifically, a characterization of (or ) on integral oriented circulant graphs is provided. As an application, we also obtain a closed-form expression for the number of integral oriented circulant graphs with fixed order having (or ).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Quantum Computing Algorithms and Architecture · Matrix Theory and Algorithms
