arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.07809quant-phcs.DSmath.PR
收藏

量子游走、离散波动方程与Chebyshev多项式

Quantum walks, the discrete wave equation and Chebyshev polynomials

Simon Apers, Laurent Miclo

AI总结:

本文受Terence Tao启发,提出从图上离散波动方程推导量子游走,将其描述为对随机游走转移矩阵应用Chebyshev多项式,从而解耦量子起源并证明格上扩散行为的二次改进。

摘要:

量子游走是随机游走的量子类比。虽然人们已经相对清楚地了解量子游走如何加速随机游走的命中时间,但量子游走能在多大程度上加速图上随机游走的扩散或混合速率,一直是一个长期悬而未决的问题。在这篇说明性论文中,受Terence Tao的一篇博客文章启发,我们描述了看待这一问题的一种特定视角,即从图上的离散波动方程推导出量子游走。这产生了一种对量子游走动力学的描述,即简单地将Chebyshev多项式应用于随机游走转移矩阵。这一视角将该问题与其量子起源解耦,并突出了与早期(非量子)工作的联系,以及在随机游走理论中使用Chebyshev多项式的情况,如Varopoulos-Carne界。我们通过证明格上量子游走动力学的弱极限来说明这种方法。这为量子游走在格上二次改进的扩散行为提供了不同的证明。

英文摘要:

A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the spreading or mixing rate of random walks on graphs. In this expository paper, inspired by a blog post by Terence Tao, we describe a particular perspective on this question that derives quantum walks from the discrete wave equation on graphs. This yields a description of the quantum walk dynamics as simply applying a Chebyshev polynomial to the random walk transition matrix. This perspective decouples the problem from its quantum origin, and highlights connections to earlier (non-quantum) work and the use of Chebyshev polynomials in random walk theory as in the Varopoulos-Carne bound. We illustrate the approach by proving a weak limit of the quantum walk dynamics on the lattice. This gives a different proof of the quadratically improved spreading behavior of quantum walks on lattices.

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

↑