Grover's algorithm


Grover's algorithm

[¦grō·vərz ′al·gə‚rith·əm] (computer science) An algorithm for finding an item in a database of 2 N items, using a quantum computer, in a time of order 2 N /2steps instead of order 2 N steps.