Part 3 Quantum Computing Algorithms
In this part, we will solve computational problems using quantum computers. For each problem, the quantum algorithm requires fewer steps than the corresponding classical algorithm. Deutsch’s algorithm finds information about all of a function’s outputs by evaluating the function only once. Grover’s algorithm searches through a list without examining each of the list’s items individually. Shor’s algorithm (unfortunately) cracks the widely-used RSA encryption scheme.
This part has the following chapters:
