Grover’s Algorithm can be oversimplified as a database search algorithm that is quadratically faster than any classical counterpart. What makes this algorithm interesting is that it determines, with high probability, the unique input when it is the output that is known.
Click here and here to read the WordPress blog articles about this project.