Quantum computing is an emerging field of interest for many branches of practical computation, ranging from cryptography to machine learning, from molecule design to drug discovery, and from physical simulations to financial optimization. Recent years have seen tremendous growth in the hardware and software applicability of quantum technology. Grover’s quantum search operation is a landmark algorithm that promises quadratic speedup over any known classical solution. Many quantum cryptographic and computational algorithms use this operation as a crucial subroutine. The performance of this algorithm under noisy conditions has garnered a lot of research interest in the recent past. We have analyzed Grover’s algorithm modeled on today’s noisy intermediate-scale quantum devices. We have used the open-source software toolkit of Qiskit modeled on IBM Quantum Devices to simulate noisy environments of different state-of-the-art quantum systems. The analysis has shown the dependence of the circuit on the number of qubits, quantum volume, and circuit layer operation per second. Apart from these factors, the analysis also showed a high dependence of the algorithm on the hardware connectivity layout.