Optimization of Grover’s Search Algorithm


Quantum mechanical computers unlike classical computers can be in a superposition of states and carry out multiple operations at the same time. Grover has shown that a quantum computer can do a random database search in O( √ N) steps. He has further proved that using the superposition of the states in quantum computing, a quantum computer should be able to do a search in a single step. He has stated that the query generated to do this search will require

3 Figures and Tables

Cite this paper

@inproceedings{Garg2008OptimizationOG, title={Optimization of Grover’s Search Algorithm}, author={Varun Garg and Anupama Pande}, year={2008} }