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

量子游走对相位反转和几何微扰的敏感性:完全图中的探索

Sensitivity of quantum walk to phase reversal and geometric perturbations: an exploration in complete graphs

Taisuke Hosaka, Renato Portugal, Etsuo Segawa

AI总结:

本文研究了完全图与星图组合并收缩顶点产生几何微扰下的量子游走动力学,发现在无预言机背景下引入相位反转可显著提升搜索微扰顶点的成功概率。

摘要:

本文分析了由主连通图 $G$ 和次连通图 $G'$ 整合而成的图结构上的量子游走动力学。该复合图由 $G$ 和 $G'$ 的不相交并集构成,随后收缩选定的一对顶点生成割点 $v^*$,从而产生一种独特形式的几何微扰。我们的研究聚焦于 $G$ 为完全图 $K_N$ 且 $G'$ 为星图 $S_m$ 的实例。分析的核心在于探索这种几何微扰对基于量子游走的搜索算法成功概率的影响,特别是在无预言机(oracle-free)的背景下。尽管初步发现表明定位微扰顶点 $v^*$ 的概率较低,但我们证明向系统引入相位反转可显著提高成功率。结果显示,在最优运行时间和特定参数条件下,成功概率可大幅提升。本文首先定义理论框架,随后呈现主要结果和详细证明,最后总结发现及未来研究方向。

英文摘要:

In this paper, we analyze the dynamics of quantum walks on a graph structure resulting from the integration of a main connected graph $G$ and a secondary connected graph $G'$. This composite graph is formed by a disjoint union of $G$ and $G'$, followed by the contraction of a selected pair of vertices creating a cut vertex $v^*$ and leading to a unique form of geometric perturbation. Our study focuses on instances where $G$ is a complete graph $K_N$ and $G'$ is a star graph $S_m$. The core of our analysis lies in exploring the impact of this geometric perturbation on the success probability of quantum walk-based search algorithms, particularly in an oracle-free context. Despite initial findings suggesting a low probability of locating the perturbed vertex $v^*$, we demonstrate that introducing a phase reversal to the system significantly enhances the success rate. Our results reveal that with an optimal running time and specific parameter conditions, the success probability can be substantially increased. The paper is structured to first define the theoretical framework, followed by the presentation of our main results, detailed proofs, and concluding with a summary of our findings and potential future research directions.

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

↑