Answers are grounded in this paper and cite their sources.
This analysis demonstrates enhanced transfer fidelity using a generalized Laplacian operator on vertex-weighted graphs, suggesting improved quantum state transfer techniques.
Quantum walks generated by the adjacency matrix or the Laplacian are known to exhibit low transfer fidelity on general graphs. In this paper, we study continuous-time quantum walks governed by the generalized Laplacian operator L_k = A+kD, where A is the adjacency matrix, D is the degree matrix, and k is a real-valued parameter. Recent work of Duda, McLaughlin, and Wong showed that in the single-excitation Heisenberg (XYZ) spin model, one can realize walks generated by this family of operators on signed weighted graphs. Motivated by earlier studies on vertex-weighted graphs, we demonstrate that for certain graphs, tuning the parameter k can significantly enhance the fidelity of state transfer between endpoints.
No takes yet. Share an insight, caveat, or question.
Yujia Shi (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: