Optimized quantum random-walk search algorithm for multi-solution search
Optimized quantum random-walk search algorithm for multi-solution search作者机构：Zhengzhou Information Science and Technology Institute Synergetic Innovation Center of Quantum Information and Quantum Physics University of Science and Technology of China
出 版 物：《Chinese Physics B》 (中国物理B（英文版）)
年 卷 期：2015年第24卷第11期
页 面：133-139页
核心收录：
学科分类：07[理学] 070201[理学-理论物理] 0702[理学-物理学]
基 金：supported by the National Basic Research Program of China(Grant No.2013CB338002)
主 题：quantum search algorithm quantum random walk multi-solution abstract search algorithm
摘 要：This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.
维普期刊数据库
同方期刊数据库