.png){kind=icon}
Return
Quantum Search Algorithm Based on Multi-Phase
.png){kind=icon}
PRE
AI
DOI：10.1088/0256-307X/31/5/050301.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The success probability of the Grover quantum search algorithm decreases quickly when the fraction of target items exceeds 1/4, where the phase plays a significant role. Therefore, we use multiple phases to complement each other. We obtain three useful properties and an important theorem of the success probability and design a systematic solution of the optimal phases for an arbitrary number of phases. Based on these results, we finally propose a multi-phase quantum search algorithm whose success probability rises with the increase of the number of phases with just a single iteration, and it tends to be 100% when the fraction of target items is over a lower limit.
Journal
IF:
4.2
Papers:
9.1K
Citations:
7.7K
Organization
Cited Papers
.png){kind=icon}
ShareSaveTranscriptome analysis of Vibrio parahaemolyticus in type III secretion system 1 inducing conditions
OAAI
OAAIShareSaveShareSaveShareSave
ShareSave
View more