Journal of Quantum Information Science

Volume 1, Issue 2 (September 2011)

ISSN Print: 2162-5751   ISSN Online: 2162-576X

Google-based Impact Factor: 0.95  Citations  

Adaptive Phase Matching in Grover’s Algorithm

HTML  Download Download as PDF (Size: 314KB)  PP. 43-49  
DOI: 10.4236/jqis.2011.12006    5,238 Downloads   9,725 Views  Citations
Author(s)

Affiliation(s)

.

ABSTRACT

When the Grover’s algorithm is applied to search an unordered database, the successful probability usually decreases with the increase of marked items. In order to solve this problem, an adaptive phase matching is proposed. With application of the new phase matching, when the fraction of marked items is greater , the successful probability is equal to 1 with at most two Grover iterations. The validity of the new phase matching is verified by a search example.

Share and Cite:

P. Li and K. Song, "Adaptive Phase Matching in Grover’s Algorithm," Journal of Quantum Information Science, Vol. 1 No. 2, 2011, pp. 43-49. doi: 10.4236/jqis.2011.12006.

Cited by

[1] Circuit realization of Grover algorithm based on Cirq
Chinese Journal of Quantum Electronics, 2022
[2] 基于 Cirq 的 Grover 搜索算法的电路实现
量子电子学报, 2022
[3] Quantum Methods for Sequence Alignment and Metagenomics
2019
[4] Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters
Quantum information processing, 2013
[5] Data Search Algorithms based on Quantum Walk
Proceedings of the International MultiConference of Engineers and Computer Scientists, 2012
[6] Quantum Search Algorithms in Analog and Digital Models
IAENG International Journal of Computer Science, 2012

Journals Menu
Follow SCIRP
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.