arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.06256quant-ph
收藏

有限图上量子游动与随机游动的等价性

On the equivalence between quantum and random walks on finite graphs

Matheus G. Andrade, Franklin Marquezino, Daniel R. Figueiredo

摘要:

图上的量子行走在量子计算中无处不在,有着广泛的应用。同样,图上的随机游走是具有不同应用的大量算法的基本构建块。虽然量子和随机游走之间的关系最近在特定的场景中进行了讨论,但这项工作建立了任意有限图上的过程与移位算子和硬币算子的一般条件之间的形式等价性。它要求赋予随机游动时间异质性,其中步行者的转移概率是不均匀的和时间依赖的。等价性是通过将在图的给定节点上测量量子行走的概率与随机行走在该相同节点上的概率相等来获得的,对于所有节点和时间步长。结果由随机游走的矩阵序列的构造过程给出,该随机游走产生与任何给定量子游走完全相同的顶点概率分布序列,包括具有多个干扰游走者的情况。有趣的是,这些矩阵允许量子行走的不同模拟方法,其中节点样本尊重邻居局部性,并且通过大数定律保证收敛,从而实现量子图轨迹(路径)的有效(多项式)采样。此外,在一般情况下,讨论了构造这个矩阵序列的复杂性。

英文摘要:

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The result is given by the construction procedure of a matrix sequence for the random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. Interestingly, these matrices allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial) sampling of quantum graph trajectories (paths). Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.

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

↑