arXivDaily arXiv每日学术速递 周一至周五更新
稍安勿躁,官方尚未更新
arXiv 2112.03374quant-phmath.CO
收藏

Quantum walks do not like bridges

Gabriel Coutinho, Chris Godsil, Emanuel Juliano, Christopher M. van Bommel

英文摘要:

We consider graphs with two cut vertices joined by a path with one or two edges, and prove that there can be no quantum perfect state transfer between these vertices, unless the graph has no other vertex. We achieve this result by applying the 1-sum lemma for the characteristic polynomial of graphs, the neutrino identities that relate entries of eigenprojectors and eigenvalues, and variational principles for eigenvalues (Cauchy interlacing, Weyl inequalities and Wielandt minimax principle). We see our result as an intermediate step to broaden the understanding of how connectivity plays a key role in quantum walks, and as further evidence of the conjecture that no tree on four or more vertices admits state transfer. We conclude with some open problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑