Sensitivity of Quantum Walk to Phase Reversal and Geometric Perturbations: An Exploration in Complete Graphs

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 KN and G′ is a star graph Sm. 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 graph G′, 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.