Using the the special properties of a quantum computer, Grover's search 
algorithm can search an unsorted table of size N for a single record in
O(sqrt(N)) time. I intend to simulate Grover's algorithm and compare its 
simulated performance to that predicted by theory. If time allows, I 
will then determine the effect of unreliable hardware on the algorithm 
and investigate how the algorithm can be modified to mitigate any
decrease in accuracy or performance.