Optimized quantum random-walk search algorithm for multi-solution search

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 mult...

Full description

Saved in:
Bibliographic Details
Published in:Chinese physics B 2015-11, Vol.24 (11), p.133-139
Main Author: 张宇超 鲍皖苏 汪翔 付向群
Format: Article
Language:English
Subjects:
Algorithms
Computer simulation
Graphs
Hypercubes
Mathematical models
Search algorithms
Searching
优化
多解
搜索算法
数值模拟
计算复杂度
超立方体
量子
随机游走
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1674-1056
2058-3834
1741-4199
DOI:10.1088/1674-1056/24/11/110309