Log in to access more pages.
Create an account or log in to continue reading more pages.
Log in
Table of contents
Quantum Compiler Engineering
From quantum circuits and intermediate representations to optimization, mapping, verification, and execution on real hardware
Read each section in order. Every title can be opened as a TheoryTrace document.
- Cover1
- Copyright2
- How to read this book3
- Introduction4
- Chapter 1: What a Quantum Compiler Does5
- Chapter 2: Mathematical Foundations for Quantum Compilation6
- Chapter 3: Qubits, Gates, Measurements, and Circuits7
- Chapter 4: Universal Gate Sets and Circuit Cost Models8
- Chapter 5: From Quantum Algorithms to Compiler Inputs9
- Chapter 6: Quantum Programming Languages and Circuit Formats10
- Chapter 7: Intermediate Representations for Quantum Programs11
- Chapter 8: Semantics and Correctness of Quantum Transformations12
- Chapter 9: Basic Circuit Analysis13
- Chapter 10: Local Circuit Optimization14
- Chapter 11: Clifford Circuits and Stabilizer-Based Compilation15
- Chapter 12: Synthesis of Single-Qubit and Two-Qubit Operations16
- Chapter 13: Multi-Qubit Unitary Synthesis17
- Chapter 14: Arithmetic, Oracles, and Reversible Logic Synthesis18
- Chapter 15: Approximate Synthesis and Solovay-Kitaev Ideas19
- Chapter 16: Mapping to Hardware Connectivity20
- Chapter 17: Scheduling and Parallelism21
- Chapter 18: Noise-Aware Compilation22
- Chapter 19: Compilation for Variational Quantum Algorithms23
- Chapter 20: Fault-Tolerant Compilation and Resource Estimation24
- Chapter 21: Verification, Testing, and Debugging25
- Chapter 22: Building a Minimal Quantum Compiler26
- Chapter 23: Case Studies on Real Quantum Toolchains27
- Chapter 24: Research Frontiers and Engineering Practice28
- Conclusion29