Quantum Computation Based Grover’s Search Algorithm and its Variations

Author(s): Kapil Kumar Soni*, Akhtar Rasool

Journal Name: Recent Patents on Engineering

Volume 15 , Issue 4 , 2021

Article ID: e210421183637
Become EABM
Become Reviewer
Call for Editor


Background: The future computations need parallelism, and a way to achieve the same is through quantum-based specific properties. Quantum computation supports exponential operation to be performed in parallel over a single execution step and hence achieves computational speedup.

Objective: One of the quantum-based algorithms allows to search the key element over an index based unstructured database and succeeds to obtain the speedup. In the whole context of article writing, our approach reviews the significance of quantum computing, the basics required for quantum computation and their quantum logic-based circuit operations.

Methods: The article focuses on Grover’s search algorithm and its variations, and then illustrates the relevant amplitude amplification & phase matching techniques in accordance with the advantages and limitation to the specific perspective.

Results: We made the comparative analysis between the amplitude amplification-based static & dynamic Grover’s searching and phase estimation technique. Along with this, we justified the possibilities of the empirical results and observed facts over Grover’s variant approaches.

Conclusion: Finally, we conclude the analytical comparison between quantum-based searching techniques along with the applicability of Grover’s algorithm in practical computational science.

Keywords: Qu-bit, superposition, quantum computation, amplitude amplification, grover’s search, phase matching.

Rights & PermissionsPrintExport Cite as

Article Details

Year: 2021
Published on: 04 May, 2021
Article ID: e210421183637
Pages: 10
DOI: 10.2174/1872212114999200710152034
Price: $25

Article Metrics

PDF: 55