The research of grover’s quantum search algorithm with use of quantum circuits QX2 and QX4

Abstract

We researched the implementation of Grover’s Algorithm on two qubits and carried out a series of experiments on the Quantum Processors QX2 and QX4 [1] to see how it can be optimized. We found that by adjusting the Oracle function of the algorithm, we can extend the solution base, from 2n to 5n, where n is the total number of available qubits that are used to build the algorithm. The method presented in this paper makes possible to execute Grover’s Algorithm with 25 different Oracle functions and obtain all unique solutions by using only 2 entangled qubits, if we choose to expand the solution base from µ ϵ {0, 1}n to µ belonging to a set of 25 unique output values, where µ is the item being searched using Grover’s method.