Stability of Grover's algorithm in respect to perturbations in quantum circuit

Grover's algorithm is a quantum algorithm for searching specified elements in an unsorted list. It has many valuable applications. The utilization of Grover's algorithm, to adapt it to accelerate the works of well-known classical algorithms, is very promising, and it is one of the fastest algorithms to solve such problems like global optimization and graph coloring. In this regard, it is very important to study the stability of the Grover's algorithm, to know how distortion of the circuit's elements affects on it results. This work presents the results of the simulation of Grover's algorithm, research of its stability with respect to perturbations of quantum logic circuit elements and its dependencies from the number of qubits, used in quantum circuit. Another part of this research was realized on IBM quantum processor and shows the stability of the 2-qubit Grover's algorithm.