Discover published sets by community

Grover’s Algorithm is designed to search an unsorted database, or solve a black-box query problem, in O(\sqrt{N}) time. Its quantum nature comes from amplitude amplification, which gives a quadratic speedup compared to the classical O(N) searching.

The Deutsch-Jozsa Algorithm determines whether a function is constant or balanced (taking equal numbers of '0's and '1's) using just a single quantum evaluation. This showcases quantum parallelism and provides an exponential advantage over any deterministic classical algorithm.

Shor's Algorithm is used for factoring large integers and finding discrete logarithms, which can break RSA encryption. What makes it quantum is the use of quantum Fourier transform and quantum parallelism to achieve exponential speedup over classical algorithms.