Demonstration of Optimal Fixed-Point Quantum Search Algorithm in IBM Quantum Computer
Abstract
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.
Cite
@article{arxiv.1712.10231,
title = {Demonstration of Optimal Fixed-Point Quantum Search Algorithm in IBM Quantum Computer},
author = {Bikramaditya Das and Kamal Gurnani and Bikash K. Behera and Prasanta K. Panigrahi},
journal= {arXiv preprint arXiv:1712.10231},
year = {2021}
}
Comments
13 pages, 7 figures, Abstract and overall text modified