Complete roadmap
Explore 170 chapters and 40 experiments across the textbook’s six volumes. Available lessons are ready to read; planned entries show what is being developed next.
Foundations
Section titled “Foundations”Programming
Section titled “Programming”| ID | Chapter | Availability |
|---|---|---|
| P01 | Programming environments: Python, notebooks, SDK choices | Planned |
| P02 | Quantum software architecture and clean project setup | Planned |
| P03 | Toolchain reproducibility: packages, versions, environments | Planned |
| P04 | Quantum circuits as code: qubits, registers and gates | Planned |
| P05 | Gate conventions, endianness and state extraction | Planned |
| P06 | Parameterised circuits and reusable builders | Planned |
| P07 | Measurement pipelines and finite-shot result handling | Planned |
| P08 | Quantum functions, modules and APIs | Planned |
| P09 | Supplied algorithms as executable contracts | Planned |
| P10 | Classical–quantum control and workflow orchestration | Planned |
| P11 | Statevector and unitary verification techniques | Planned |
| P12 | Probabilistic assertions and confidence intervals | Planned |
| P13 | Property-based and metamorphic quantum tests | Planned |
| P14 | Debugging quantum logic and circuit defects | Planned |
| P15 | Test-driven circuit development and mutation testing | Planned |
| P16 | Backend abstraction and simulation choices | Planned |
| P17 | Compilation and transpilation fundamentals | Planned |
| P18 | Native gates, decomposition and qubit connectivity | Planned |
| P19 | Circuit depth, width, swap overhead and resource reports | Planned |
| P20 | Noise models, backend constraints and execution budgets | Planned |
| P21 | Reproducible experiments, seeds and provenance | Planned |
| P22 | Notebooks, packages, documentation and Git workflows | Planned |
| P23 | Responsible AI-assisted quantum software engineering | Planned |
| P24 | Capstone: reliable, portable quantum software component | Planned |
Algorithms
Section titled “Algorithms”| ID | Chapter | Availability |
|---|---|---|
| A01 | What Makes a Quantum Algorithm Different? | Planned |
| A02 | Deutsch’s Algorithm | Planned |
| A03 | Deutsch–Jozsa Algorithm | Planned |
| A04 | Bernstein–Vazirani Algorithm | Planned |
| A05 | Simon’s Algorithm | Planned |
| A06 | Grover’s Search Algorithm | Planned |
| A07 | Amplitude Amplification | Planned |
| A08 | Quantum Counting | Planned |
| A09 | Quantum Amplitude Estimation | Planned |
| A10 | Quantum Walk Algorithms | Planned |
| A11 | Quantum Fourier Transform | Planned |
| A12 | Quantum Phase Estimation | Planned |
| A13 | Order Finding | Planned |
| A14 | Shor’s Factoring Algorithm | Planned |
| A15 | Hidden Subgroup Problems | Planned |
| A16 | Introduction to Optimisation Problems | Planned |
| A17 | QUBO and Ising Models | Planned |
| A18 | Quantum Approximate Optimisation Algorithm | Planned |
| A19 | Variational Quantum Eigensolver | Planned |
| A20 | Quantum Annealing | Planned |
| A21 | Quantum Optimisation and Classical Baselines | Planned |
| A22 | Hamiltonian Simulation | Planned |
| A23 | Trotter–Suzuki Methods | Planned |
| A24 | Linear Combination of Unitaries | Planned |
| A25 | Qubitization | Planned |
| A26 | HHL Quantum Linear Systems Algorithm | Planned |
| A27 | Block Encoding | Planned |
| A28 | Quantum Singular Value Transformation | Planned |
| A29 | Quantum Machine Learning | Planned |
| A30 | Quantum Kernels | Planned |
| A31 | Variational Quantum Classifiers | Planned |
| A32 | Quantum Sampling Algorithms | Planned |
| A33 | Applications in Cryptography and Security | Planned |
| A34 | Quantum Algorithms in Real-World Optimisation | Planned |
| A35 | Quantum Advantage and Complexity | Planned |
| A36 | Noise and Resource Estimation | Planned |
| A37 | Error Mitigation and Error Correction | Planned |
| A38 | Fault-Tolerant Algorithm Considerations | Planned |
| A39 | Quantum versus Classical Benchmarking | Planned |
| A40 | Open Research Challenges | Planned |
| ID | Chapter | Availability |
|---|---|---|
| AA01 | Adiabatic quantum computation and algorithmic equivalences | Planned |
| AA02 | Quantum minimum finding (Dürr–Høyer) | Planned |
| AA03 | Amplitude estimation variants and modern iterative approaches | Planned |
| AA04 | Quantum signal processing and polynomial transformations | Planned |
| AA05 | Quantum eigenvalue transformation and spectral filtering | Planned |
| AA06 | Quantum singular value transformation applications | Planned |
| AA07 | Quantum linear-algebra improvements and input/output assumptions | Planned |
| AA08 | Quantum principal components and spectral methods | Planned |
| AA09 | Quantum recommendation and nearest-neighbour ideas | Planned |
| AA10 | Quantum gradient and derivative estimation | Planned |
| AA11 | Quantum approximate counting and mean estimation | Planned |
| AA12 | Quantum Monte Carlo integration and risk estimation | Planned |
| AA13 | Quantum Gibbs-state preparation and thermal sampling | Planned |
| AA14 | Quantum Metropolis methods and thermalisation | Planned |
| AA15 | Quantum walk search on graphs and spatial search | Planned |
| AA16 | Element distinctness and collision problems | Planned |
| AA17 | Quantum backtracking and tree-search methods | Planned |
| AA18 | Formula evaluation and span-program viewpoints | Planned |
| AA19 | Quantum dynamic programming and graph problems | Planned |
| AA20 | Quantum learning theory and sample complexity | Planned |
| AA21 | Quantum neural network models and barren plateaus | Planned |
| AA22 | Quantum generative modelling and Born machines | Planned |
| AA23 | Quantum chemistry and electronic structure workflows | Planned |
| AA24 | Quantum PDE/ODE ideas and differential-equation algorithms | Planned |
| AA25 | Quantum finance and stochastic modelling | Planned |
| AA26 | Quantum methods for scientific optimisation and energy systems | Planned |
| AA27 | Query adversary and lower-bound techniques | Planned |
| AA28 | Hamiltonian simulation algorithms beyond product formulas | Planned |
| AA29 | Precision, condition-number and fault-tolerance costs | Planned |
| AA30 | Dequantisation, quantum-inspired classical algorithms and honest baselines | Planned |
Security
Section titled “Security”| ID | Chapter | Availability |
|---|---|---|
| S01 | Classical cryptography refresher: symmetric keys and hashes | Planned |
| S02 | Public-key cryptography: RSA, ECC and finite groups | Planned |
| S03 | Key exchange, KEMs, certificates and digital signatures | Planned |
| S04 | Security notions, threat modelling and threat timelines | Planned |
| S05 | Quantum computing threat to RSA and ECC | Planned |
| S06 | Shor’s algorithm as a cryptanalytic threat | Planned |
| S07 | Grover search and symmetric-key security margins | Planned |
| S08 | Harvest-now-decrypt-later and information lifetime | Planned |
| S09 | Introduction to quantum communication | Planned |
| S10 | Measurement bases, no-cloning and channel models | Planned |
| S11 | QKD versus post-quantum cryptography | Planned |
| S12 | BB84: states, bases and sifting | Planned |
| S13 | BB84: error rates, intercept–resend and noise | Planned |
| S14 | Finite-key statistics, confidence and leakage | Planned |
| S15 | Error reconciliation and privacy amplification | Planned |
| S16 | Authentication, side channels and QKD operational limits | Planned |
| S17 | E91, entanglement-based QKD and CHSH context | Planned |
| S18 | Decoy-state and measurement-device-independent QKD | Planned |
| S19 | Security evaluation of QKD simulations | Planned |
| S20 | PQC design goals and underlying hard problems | Planned |
| S21 | ML-KEM and FIPS 203: learning and safe libraries | Planned |
| S22 | ML-DSA and FIPS 204: signature verification | Planned |
| S23 | SLH-DSA and FIPS 205: hash-based signatures | Planned |
| S24 | PQC integration, hybrid key establishment and interoperability | Planned |
| S25 | Cryptographic inventories, crypto-agility and migration planning | Planned |
| S26 | Migration capstone: standards, risk and technical assurance | Planned |
Advanced
Section titled “Advanced”| ID | Chapter | Availability |
|---|---|---|
| X01 | Quantum channels, density matrices and mixed states | Planned |
| X02 | Noise representations: Kraus maps and CPTP channels | Planned |
| X03 | Quantum process tomography and state estimation | Planned |
| X04 | Information measures and quantum entropy | Planned |
| X05 | Bell inequalities, nonlocal games and contextuality | Planned |
| X06 | Fault-tolerant thresholds and logical qubits | Planned |
| X07 | Stabilizer formalism and Clifford circuits | Planned |
| X08 | Quantum error correction: repetition and surface codes | Planned |
| X09 | Syndrome extraction and decoding basics | Planned |
| X10 | Logical gates, transversal gates and magic states | Planned |
| X11 | Error mitigation: ZNE, PEC and measurement mitigation | Planned |
| X12 | Randomised benchmarking and device characterisation | Planned |
| X13 | Hamiltonian complexity and simulation limits | Planned |
| X14 | Resource estimation and space–time cost | Planned |
| X15 | Distributed quantum computing and quantum networks | Planned |
| X16 | Quantum communications protocols beyond QKD | Planned |
| X17 | Quantum sensing and metrology | Planned |
| X18 | Quantum machine learning research directions | Planned |
| X19 | AI workloads and quantum algorithm mappings | Planned |
| X20 | Quantum-inspired classical optimisation | Planned |
| X21 | Applications: energy, logistics and scheduling | Planned |
| X22 | Quantum software and research reproducibility | Planned |
| X23 | Research methodology: falsifiable advantage claims | Planned |
| X24 | Open challenges, literature reading and reproducible projects | Planned |
Experiment catalogue
Section titled “Experiment catalogue”Ten tools are implemented with bounded ideal models and seeded sampling. The other thirty tools retain their original IDs as planned work. “Verified” here refers to automated numerical and interface checks, not independent scientific certification.
| ID | Experiment | Status |
|---|---|---|
| L01 | Qubit Explorer | Open studio |
| L02 | Quantum Gate Playground | Open studio |
| L03 | Superposition and Interference | Open studio |
| L04 | Entanglement Explorer | Open studio |
| L05 | Deutsch–Jozsa Explorer | Open studio |
| L06 | Grover Search Explorer | Open studio |
| L07 | Quantum Fourier Transform | Open studio |
| L08 | Quantum Phase Estimation | Open studio |
| L09 | Shor’s Algorithm | Planned |
| L10 | QAOA Explorer | Planned |
| L11 | VQE Explorer | Planned |
| L12 | Quantum Linear Systems / HHL | Planned |
| L13 | Quantum basis and measurement explorer | Planned |
| L14 | Reversible Boolean oracle builder | Planned |
| L15 | Shot noise and confidence-interval lab | Open studio |
| L16 | Circuit debugger and minimal repair | Planned |
| L17 | Parameterised circuits and API tests | Planned |
| L18 | Backend execution and result parser | Planned |
| L19 | Transpilation and connectivity visualiser | Planned |
| L20 | Circuit-depth and resource inspector | Planned |
| L21 | Property/metamorphic test sandbox | Planned |
| L22 | Noise model and reproducibility studio | Planned |
| L23 | QUBO / Ising encoding workbench | Planned |
| L24 | Classical vs quantum comparison bench | Planned |
| L25 | Optimiser comparison: SPSA vs DE | Planned |
| L26 | Grover oracle synthesis cost explorer | Planned |
| L27 | Quantum walks on small graphs | Planned |
| L28 | Amplitude estimation and counting | Planned |
| L29 | Hamiltonian time evolution | Planned |
| L30 | QSVT polynomial transform explorer | Planned |
| L31 | BB84 intercept–resend and QBER lab | Open studio |
| L32 | BB84 finite-key uncertainty lab | Planned |
| L33 | Noise-versus-adversary evidence lab | Planned |
| L34 | Entanglement-based QKD explorer | Planned |
| L35 | PQC KEM practice notebook | Planned |
| L36 | PQC signature verification notebook | Planned |
| L37 | Cryptographic inventory/migration planner | Planned |
| L38 | Error correction syndrome visualiser | Planned |
| L39 | Error mitigation comparison laboratory | Planned |
| L40 | Quantum resource estimation studio | Planned |