Optimized quantum random-walk search algorithm for multi-solution search<xref ref-type="fn" rid="cpb150616fn1">*</xref>

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

Zhang Yu-Chao^a),^b), Bao Wan-Su^a),^b), Wang Xiang^a),^b), Fu Xiang-Qun^a),^b)

Relationship between the success rate of the algorithm and the number of iterations when q = 0.5. The circles line represents N = 64 and the asterisks line represents N = 256.