Grover's Quantum Search Algorithm
Samuel J. Lomonaco · Wolfram Demonstrations Project · 2007
Quantum computers may solve some problems dramatically faster than conventional machines One example is searching an unordered set for an item with specific properties A quantum algorithm can find such an item a solution in a time proportional to the square root of the size of the set which is considerably faster than conventional classical methods on large sets This Demonstration compares classic