Implementation of Database Search with Quantum Computing: Grover's Algorithm vs Linear Search | IEEE Conference Publication | IEEE Xplore

Implementation of Database Search with Quantum Computing: Grover's Algorithm vs Linear Search


Abstract:

The present study aims to examine the real-world implications of Grover's algorithm, specifically focusing on its quadratic speedup in contrast to classical linear search...Show More

Abstract:

The present study aims to examine the real-world implications of Grover's algorithm, specifically focusing on its quadratic speedup in contrast to classical linear search techniques employed for unsorted databases. The objective is to bridge the gap between theoretical potential and practical application in the field of quantum computing. This study conducts a comprehensive analysis of Grover's Algorithm and traditional linear search across databases of varying sizes, uniquely contributing by empirically validating Grover's Algorithm's superior performance and aligning it with theoretical expectations. Significantly, the study expands its analysis to encompass larger databases, further affirming the algorithm's utility in handling growing database sizes. This study significantly contributes to the progress of quantum computing through the practical implementation of theoretical principles as well as enhancing the scientific community's understanding of quantum search algorithms and their relative efficacy.
Date of Conference: 02-03 November 2023
Date Added to IEEE Xplore: 22 January 2024
ISBN Information:
Conference Location: Ballari, India

Contact IEEE to Subscribe

References

References is not available for this document.