@Article{jqc.2021.018114,
AUTHOR = {Saasha Joshi, Deepti Gupta},
TITLE = {Grover’s Algorithm in a 4-Qubit Search Space},
JOURNAL = {Journal of Quantum Computing},
VOLUME = {3},
YEAR = {2021},
NUMBER = {4},
PAGES = {137--150},
URL = {http://www.techscience.com/jqc/v3n4/46224},
ISSN = {2579-0145},
ABSTRACT = {This paper provides an introduction to a quantum search algorithm, 
known as Grover’s Algorithm, for unsorted search purposes. The algorithm is 
implemented in a search space of 4 qubits using the Python-based Qiskit SDK by 
IBM. While providing detailed proof, the computational complexity of the 
algorithm is generalized to n qubits. The implementation results obtained from the 
IBM QASM Simulator and IBMQ Santiago quantum backend are analyzed and 
compared. Finally, the paper discusses the challenges faced in implementation and 
real-life applications of the algorithm hitherto. Overall, the implementation and 
analysis depict the advantages of this quantum search algorithm over its classical 
counterparts.},
DOI = {10.32604/jqc.2021.018114}
}