Table of Content

Open Access iconOpen Access

ARTICLE

crossmark

Grover’s Algorithm in a 4-Qubit Search Space

Saasha Joshi*, Deepti Gupta

Department of Computer Science and Engineering, University Institute of Engineering and Technology, Panjab University, Chandigarh, 160014, India

* Corresponding Author: Saasha Joshi. Email: email

Journal of Quantum Computing 2021, 3(4), 137-150. https://doi.org/10.32604/jqc.2021.018114

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.

Keywords


Cite This Article

APA Style
Joshi, S., Gupta, D. (2021). Grover’s algorithm in a 4-qubit search space. Journal of Quantum Computing, 3(4), 137-150. https://doi.org/10.32604/jqc.2021.018114
Vancouver Style
Joshi S, Gupta D. Grover’s algorithm in a 4-qubit search space. J Quantum Comput . 2021;3(4):137-150 https://doi.org/10.32604/jqc.2021.018114
IEEE Style
S. Joshi and D. Gupta, "Grover’s Algorithm in a 4-Qubit Search Space," J. Quantum Comput. , vol. 3, no. 4, pp. 137-150. 2021. https://doi.org/10.32604/jqc.2021.018114



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2044

    View

  • 2209

    Download

  • 0

    Like

Share Link