Laplacian pretty good edge state transfer in paths
Wei Wang, Xiaogang Liu, Jing Wang
TL;DR
This paper characterizes when paths exhibit Laplacian pretty good edge state transfer, providing a necessary and sufficient condition and advancing understanding of quantum state transfer in graph structures.
Contribution
It offers a complete characterization of Laplacian pretty good edge state transfer specifically in path graphs, based on new theoretical conditions.
Findings
Established a necessary and sufficient condition for Laplacian pretty good pair state transfer.
Provided a complete characterization of Laplacian pretty good edge state transfer in paths.
Enhanced understanding of quantum state transfer in graph-based systems.
Abstract
In this paper, we first give a necessary and sufficient condition for a graph to have Laplacian pretty good pair state transfer. As an application of such result, we give a complete characterization of Laplacian pretty good edge state transfer in paths.
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 · Graph theory and applications