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.

• Cover
• Copyright
• How to read this book
• Introduction
• Chapter 1: Why Quantum Computing Exists
• Chapter 2: Classical Bits, Logic, and Computation
• Chapter 3: The Mathematical Language of Quantum States
• Chapter 4: Qubits and Superposition
• Chapter 5: Measurement and the Born Rule
• Chapter 6: Single-Qubit Gates
• Chapter 7: Multiple Qubits and Tensor Products
• Chapter 8: Entanglement
• Chapter 9: Multi-Qubit Gates and Quantum Circuits
• Chapter 10: Reversibility and Quantum Logic
• Chapter 11: Interference as a Computational Resource
• Chapter 12: First Quantum Algorithms
• Chapter 13: The Quantum Fourier Transform
• Chapter 14: Phase Estimation
• Chapter 15: Shor’s Algorithm and Factoring
• Chapter 16: Grover’s Search Algorithm
• Chapter 17: Quantum Simulation
• Chapter 18: Noise, Decoherence, and Real Hardware
• Chapter 19: Quantum Error Correction
• Chapter 20: Quantum Programming and Practical Workflows
• Chapter 21: Near-Term Quantum Algorithms
• Chapter 22: Quantum Complexity and What Speedup Really Means
• Chapter 23: Quantum Cryptography and Communication
• Chapter 24: The Road Ahead
• Conclusion