Log in to access more pages.
Guests can read through the introduction. Explorer continues through Chapter 3.
Log in
Table of contents
Grover's Algorithm from First Principles
A complete undergraduate path from quantum basics to designing and using quantum search algorithms
Read each section in order. Every title can be opened as a TheoryTrace document.
- Cover1
- Copyright2
- How to read this book3
- Introduction4
- Chapter 1: Why Quantum Search Matters5
- Chapter 2: Complex Numbers, Vectors, and Inner Products6
- Chapter 3: Qubits and Quantum States7
- Chapter 4: Measurement and Probability8
- Chapter 5: Quantum Gates and Circuits9
- Chapter 6: Reversible Computation and Oracles10
- Chapter 7: The Unstructured Search Problem11
- Chapter 8: Phase Kickback and Phase Oracles12
- Chapter 9: Creating the Uniform Superposition13
- Chapter 10: The Diffusion Operator14
- Chapter 11: One Full Grover Iteration15
- Chapter 12: The Geometry of Amplitude Amplification16
- Chapter 13: How Many Iterations Are Needed17
- Chapter 14: Complexity and the Quadratic Speedup18
- Chapter 15: Multiple Solutions and Unknown Solution Counts19
- Chapter 16: Building Practical Grover Oracles20
- Chapter 17: Worked Example: Searching a Small Space21
- Chapter 18: Using Grover in Quantum Programming Frameworks22
- Chapter 19: Noise, Hardware Limits, and Real Devices23
- Chapter 20: Amplitude Amplification Beyond Search24
- Chapter 21: Applications and Misapplications25
- Chapter 22: From Grover to Future Quantum Algorithms26
- Conclusion27