Part 3 Solving a classical problem using a quantum algorithm

By this point of the book, we’ve covered a lot of building blocks of quantum algorithms and ways to test them. Now, it’s time to put them to practice! The third and final part of the book follows the end-to-end process of solving a problem using a quantum algorithm. It includes formulating the problem in quantum terms, coming up with an algorithm to solve it, implementing the solution, testing it, and evaluating its quality.

Chapter 6 covers the first step of the workflow, showing how classical functions can be represented and evaluated as part of quantum computations. Chapter 7 introduces Grover’s algorithm for solving search problems—one of the most famous quantum algorithms. In chapter 8, you use Grover’s search algorithm to solve the N queens puzzle, learning to apply a theoretical algorithm to a realistic problem. Finally, chapter 9 discusses the performance of quantum programs running on fault-tolerant quantum computers. It dives into comparing quantum solutions with classical ones to figure out whether a quantum algorithm has the potential to show practical quantum advantage for a given problem.