Log in to access more pages.
Guests can read through the introduction. Explorer continues through Chapter 3.
Log in
Table of contents
Quantum Computing from First Principles
A motivating undergraduate path from zero knowledge to building and understanding quantum 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 Computing Exists5
- Chapter 2: Classical Bits, Logic, and Computation6
- Chapter 3: The Mathematical Language of Quantum States7
- Chapter 4: Qubits and Superposition8
- Chapter 5: Measurement and the Born Rule9
- Chapter 6: Single-Qubit Gates10
- Chapter 7: Multiple Qubits and Tensor Products11
- Chapter 8: Entanglement12
- Chapter 9: Multi-Qubit Gates and Quantum Circuits13
- Chapter 10: Reversibility and Quantum Logic14
- Chapter 11: Interference as a Computational Resource15
- Chapter 12: First Quantum Algorithms16
- Chapter 13: The Quantum Fourier Transform17
- Chapter 14: Phase Estimation18
- Chapter 15: Shor’s Algorithm and Factoring19
- Chapter 16: Grover’s Search Algorithm20
- Chapter 17: Quantum Simulation21
- Chapter 18: Noise, Decoherence, and Real Hardware22
- Chapter 19: Quantum Error Correction23
- Chapter 20: Quantum Programming and Practical Workflows24
- Chapter 21: Near-Term Quantum Algorithms25
- Chapter 22: Quantum Complexity and What Speedup Really Means26
- Chapter 23: Quantum Cryptography and Communication27
- Chapter 24: The Road Ahead28
- Conclusion29