Quantum Boolean circuit approach for searching an unordered database

Abstract

The discovery of polynomial time prime factorization, secure key distribution, and fast database search algorithm have recently made quantum computing the most rapidly expanding research field. For a quantum algorithm to be useful, it is essential that the algorithm can be implemented using quantum circuits. Nanotechnology, in particular quantum mechanics based devices, can be used to realize such an algorithm. In this paper, we show how quantum Boolean circuits can be used to implement the oracle circuit and the inversion-about-average function in Grover's search algorithm. We also show that a slight modification of the oracle circuit can be used to search multiple targets.