Demonstration of Optimal Fixed Point Quantum Search Algorithm : An IBM Quantum Experience.
Year: 2021
Type: preprint
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, more precisely the optimal Grover's search algorithm, in IBMQ simulator developed by IBM corporation. We perform the Grover's search algorithm for one-iteration for two, three, four and five qubit systems and confirm the accuracy of our results through histogram.
Source: arXiv (Cornell University)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3214891751