  A quantum algorithm is a set of instructions for a quantum computer, however,
unlike algorithms in classical computer science their results cannot be
guaranteed. Quantum search algorithm can be described as the rotation of state
vectors in a Hilbert space. The state vectors uniformly rotate by iterative
sequences until they hit the target position. To optimize the algorithm, it is
necessary to have the precise knowledge about some parameters like the number
of target positions and total number of states. Here, we demonstrate the
implementation of optimal fixed-point quantum search algorithm in IBMQ
simulator developed by IBM corporation. We perform the search algorithm for
one-iteration for two, three, four and five qubit systems and confirm the
accuracy of our results through histogram.
