Perfect state transfer in graphs related to linear groups in two dimensions
Venkata Raghu Tej Pantangi, Peter Sin

TL;DR
This paper constructs specific graphs derived from linear groups over finite fields, demonstrating that quantum walks on these networks enable perfect state transfer, which is significant for quantum communication.
Contribution
It introduces new families of graphs based on linear groups that facilitate perfect quantum state transfer, expanding the understanding of quantum network design.
Findings
Graphs from $ ext{SL}(2,q)$, $ ext{GL}(2,q)$, and $ ext{GU}(2,q^2)$ support perfect state transfer.
Quantum walks on these graphs exhibit ideal transfer properties.
The construction applies to graphs with $q$ an odd prime power.
Abstract
We construct families of graphs from linear groups , and , where is an odd prime power, with the property that the continuous-time quantum walks on the associated networks of qubits admit perfect 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 Mechanics and Applications · Opinion Dynamics and Social Influence
