Optimized quantum random-walk search algorithm for multi-solution search
Lists
Only you see this
Abstract
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.
BibTeX
@inproceedings{zhang2015optimized,
author = {Yuchao Zhang and Wan‐Su Bao and Xiang Wang and Xiang-Qun Fu},
title = {{Optimized quantum random-walk search algorithm for multi-solution search}},
booktitle = {Chinese},
year = {2015},
doi = {10.1088/1674-1056/24/11/110309},
}Loading related content...