Work

Demonstration of Optimal Fixed-Point Quantum Search Algorithm in IBM Quantum Computer

Year: 2017

Type: preprint

Abstract: 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. Here we demonstrate the implementation of optimal fixed-point quantum search (OFPQS) algorithm in a five-qubit quantum computer developed by IBM Corporation. We perform the OFPQS algorithm for one and two-iterations and confirm the accuracy of our results by state tomography process.

Source: arXiv (Cornell University)

Authors: Kamal Gurnani, Bikash K. Behera, Prasanta K. Panigrahi

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2780547534

Cites: 34

Cited by: 5

Related to: 10