12.2 Heuristics
Is there a difference between an algorithm that provides an exact sequence of steps to follow to solve a problem and a quick-and-dirty solution with shortcuts that may work sometimes? This section discusses the latter, but, for contrast, note that we have seen many examples of exact algorithms: algorithm$heuristic heuristic
- Addition in section 2.5
- Sorting in section 2.8.1
- Searching in section 2.8.2
- Euclid’s algorithm in section 3.4.1
- The Gram-Schmidt orthonormalization process in section 5.7.6
- Quantum teleportation in section 9.3.5
- Amplitude amplification in section 9.6
- Grover’s search algorithm in section 9.7.1
- The Deutsch-Jozsa algorithm in section 9.8
- The Bernstein-Vazirani algorithm in section 9.9
- Simon’s algorithm in section 9.10
- The Quantum Fourier Transform in section 10.1
- Phase estimation in section...
