Quantum state transfer on Q-graphs
Xiao-Qin Zhang, Shu-Yu Cui, Gui-Xian Tian

TL;DR
This paper investigates quantum state transfer properties in Q-graphs derived from regular graphs, establishing conditions under which perfect or pretty good state transfer occurs, and identifying new families of such graphs.
Contribution
It provides new theoretical results linking eigenvalues of regular graphs to quantum state transfer capabilities in their Q-graphs, including conditions for no perfect transfer and the existence of pretty good transfer.
Findings
Regular graphs with all integer eigenvalues have Q-graphs with no perfect state transfer.
Q-graphs of regular graphs can exhibit pretty good state transfer under mild conditions.
Many new families of Q-graphs are identified that lack perfect transfer but have pretty good transfer.
Abstract
We study the existence of quantum state transfer in -graphs in this paper. The -graph of a graph , denoted by , is the graph derived from by plugging a new vertex to each edge of and joining two new vertices which lie on adjacent edges of by an edge. We show that, if all eigenvalues of a regular graph are integers, then its -graph has no perfect state transfer. In contrast, we also prove that the -graph of a regular graph has pretty good state transfer under some mild conditions. Finally, applying the obtained results, we also exhibit many new families of -graphs having no perfect state transfer, but admitting pretty good state transfer.
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
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
