中国物理B ›› 2015, Vol. 24 ›› Issue (6): 60304-060304.doi: 10.1088/1674-1056/24/6/060304
张宇超a b, 鲍皖苏a b, 汪翔a b, 付向群a b
Zhang Yu-Chao (张宇超)a b, Bao Wan-Su (鲍皖苏)a b, Wang Xiang (汪翔)a b, Fu Xiang-Qun (付向群)a b
摘要: This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover's algorithm.
中图分类号: (Quantum computation architectures and implementations)