Abstract
This chapter examines Grover's algorithm, a quantum algorithm known for its efficacy in searching unsorted databases. Starting with a theoretical exposition complemented by geometric explanations and exemplified through iterative demonstrations, readers gain a clear understanding of the algorithmic principles at play. Then, this chapter examines the quantum domain, the exposition encompasses a comprehensive breakdown of the quantum circuit's construction, describing the specific roles of each constituent in facilitating algorithmic execution. Grover's algorithm is known for its remarkable ability to significantly reduce the computational resources required for executing the brute-force search problem. The chapter concludes with practical showcases utilising the Qiskit programming framework, thereby demonstrating the algorithm's scalability and practical utility across varying problem dimensions.
| Original language | English |
|---|---|
| Title of host publication | Quantum Computing |
| Subtitle of host publication | A Journey into the Next Frontier of Information and Communication Security |
| Publisher | CRC Press |
| Pages | 76-94 |
| Number of pages | 19 |
| ISBN (Electronic) | 9781040272220 |
| ISBN (Print) | 9781032757049 |
| DOIs | |
| State | Published - 1 Jan 2024 |
Bibliographical note
Publisher Copyright:© 2025 selection and editorial matter, Mohammad Hammoudeh, Abdullah T. Alessa, Amro M. Sher- beeni, Clinton M. Firth, and Abdullah S. Alessa; individual chapters, the contributors.
ASJC Scopus subject areas
- General Computer Science
- General Mathematics