DocumentCode
1735967
Title
Phase matching in grover´s algorithm
Author
Li Xin ; Song Kaoping ; Sun Ning ; Zhao Chunli
Author_Institution
Sch. of Comput. & Inf. Technol., Northeast Pet. Univ., Daqing, China
fYear
2013
Firstpage
7939
Lastpage
7942
Abstract
When the Grover´s algorithm is applied to search an unordered database, the probability of getting correct results usually decreases with the increase of marked items. The reason for this phenomenon is analyzed in this Letter, the Grover iteration is studied, and a new phase matching is proposed. With application of the new phase matching, when the fraction of marked items is greater than 1/3, the probability of getting correct results is greater than 25/27 with only one Grover iteration. The validity of the new phase matching is verified by a search example.
Keywords
iterative methods; probability; quantum computing; quantum theory; search problems; Grover algorithm; Grover iteration; item marking; phase matching; probability; unordered database search; Algorithm design and analysis; Databases; Educational institutions; Frequency conversion; Petroleum; Quantum computing; Quantum mechanics; Grover algorithm; Phase matching; Quantum computing; Quantum searching;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (CCC), 2013 32nd Chinese
Conference_Location
Xi´an
Type
conf
Filename
6640838
Link To Document