Explore the book
The book has six complementary volumes, including an advanced algorithm atlas. Start anywhere: every route is open, and prerequisite links offer guidance rather than access restrictions.
This is a growing editorial release. Available lessons have reading content, experiments where relevant, and chapter PDFs. Planned entries show the topics being developed next. The author’s complete introduction is also available.
170 chapters · 26 foundation lessons available now
- F01Classical Computing versus Quantum ComputingRead lesson
- F02Introduction to Quantum InformationRead lesson
- F03Essential Mathematics: Complex NumbersRead lesson
- F04Vectors, Matrices and Linear AlgebraRead lesson
- F05Dirac Notation: Kets and BrasRead lesson
- F06Probability, Amplitudes and NormalisationRead lesson
- F07Understanding QubitsRead lesson
- F08SuperpositionRead lesson
- F09Quantum MeasurementRead lesson
- F10Quantum Phase and InterferenceRead lesson
- F11The Bloch SphereRead lesson
- F12Multiple Qubits and Tensor ProductsRead lesson
- F13Entanglement and Bell StatesRead lesson
- F14Quantum Reversibility and the No-Cloning PrincipleRead lesson
- F15Introduction to Quantum GatesRead lesson
- F16Pauli Gates and the Hadamard GateRead lesson
- F17Phase and Rotation GatesRead lesson
- F18Controlled Gates and CNOTRead lesson
- F19Constructing Quantum CircuitsRead lesson
- F20Quantum Oracles and Phase KickbackRead lesson
- F21Measuring and Simulating Quantum CircuitsRead lesson
- F22Quantum Noise and Hardware LimitationsRead lesson
- F23Classical versus Quantum Algorithmic ComplexityRead lesson
- F24Quantum Queries and OraclesRead lesson
- F25How Quantum Algorithms Use InterferenceRead lesson
- F26First Complete Quantum AlgorithmRead lesson
- P01Programming environments: Python, notebooks, SDK choicesPlanned
- P02Quantum software architecture and clean project setupPlanned
- P03Toolchain reproducibility: packages, versions, environmentsPlanned
- P04Quantum circuits as code: qubits, registers and gatesPlanned
- P05Gate conventions, endianness and state extractionPlanned
- P06Parameterised circuits and reusable buildersPlanned
- P07Measurement pipelines and finite-shot result handlingPlanned
- P08Quantum functions, modules and APIsPlanned
- P09Supplied algorithms as executable contractsPlanned
- P10Classical–quantum control and workflow orchestrationPlanned
- P11Statevector and unitary verification techniquesPlanned
- P12Probabilistic assertions and confidence intervalsPlanned
- P13Property-based and metamorphic quantum testsPlanned
- P14Debugging quantum logic and circuit defectsPlanned
- P15Test-driven circuit development and mutation testingPlanned
- P16Backend abstraction and simulation choicesPlanned
- P17Compilation and transpilation fundamentalsPlanned
- P18Native gates, decomposition and qubit connectivityPlanned
- P19Circuit depth, width, swap overhead and resource reportsPlanned
- P20Noise models, backend constraints and execution budgetsPlanned
- P21Reproducible experiments, seeds and provenancePlanned
- P22Notebooks, packages, documentation and Git workflowsPlanned
- P23Responsible AI-assisted quantum software engineeringPlanned
- P24Capstone: reliable, portable quantum software componentPlanned
- A01What Makes a Quantum Algorithm Different?Planned
- A02Deutsch’s AlgorithmPlanned
- A03Deutsch–Jozsa AlgorithmPlanned
- A04Bernstein–Vazirani AlgorithmPlanned
- A05Simon’s AlgorithmPlanned
- A06Grover’s Search AlgorithmPlanned
- A07Amplitude AmplificationPlanned
- A08Quantum CountingPlanned
- A09Quantum Amplitude EstimationPlanned
- A10Quantum Walk AlgorithmsPlanned
- A11Quantum Fourier TransformPlanned
- A12Quantum Phase EstimationPlanned
- A13Order FindingPlanned
- A14Shor’s Factoring AlgorithmPlanned
- A15Hidden Subgroup ProblemsPlanned
- A16Introduction to Optimisation ProblemsPlanned
- A17QUBO and Ising ModelsPlanned
- A18Quantum Approximate Optimisation AlgorithmPlanned
- A19Variational Quantum EigensolverPlanned
- A20Quantum AnnealingPlanned
- A21Quantum Optimisation and Classical BaselinesPlanned
- A22Hamiltonian SimulationPlanned
- A23Trotter–Suzuki MethodsPlanned
- A24Linear Combination of UnitariesPlanned
- A25QubitizationPlanned
- A26HHL Quantum Linear Systems AlgorithmPlanned
- A27Block EncodingPlanned
- A28Quantum Singular Value TransformationPlanned
- A29Quantum Machine LearningPlanned
- A30Quantum KernelsPlanned
- A31Variational Quantum ClassifiersPlanned
- A32Quantum Sampling AlgorithmsPlanned
- A33Applications in Cryptography and SecurityPlanned
- A34Quantum Algorithms in Real-World OptimisationPlanned
- A35Quantum Advantage and ComplexityPlanned
- A36Noise and Resource EstimationPlanned
- A37Error Mitigation and Error CorrectionPlanned
- A38Fault-Tolerant Algorithm ConsiderationsPlanned
- A39Quantum versus Classical BenchmarkingPlanned
- A40Open Research ChallengesPlanned
- AA01Adiabatic quantum computation and algorithmic equivalencesPlanned
- AA02Quantum minimum finding (Dürr–Høyer)Planned
- AA03Amplitude estimation variants and modern iterative approachesPlanned
- AA04Quantum signal processing and polynomial transformationsPlanned
- AA05Quantum eigenvalue transformation and spectral filteringPlanned
- AA06Quantum singular value transformation applicationsPlanned
- AA07Quantum linear-algebra improvements and input/output assumptionsPlanned
- AA08Quantum principal components and spectral methodsPlanned
- AA09Quantum recommendation and nearest-neighbour ideasPlanned
- AA10Quantum gradient and derivative estimationPlanned
- AA11Quantum approximate counting and mean estimationPlanned
- AA12Quantum Monte Carlo integration and risk estimationPlanned
- AA13Quantum Gibbs-state preparation and thermal samplingPlanned
- AA14Quantum Metropolis methods and thermalisationPlanned
- AA15Quantum walk search on graphs and spatial searchPlanned
- AA16Element distinctness and collision problemsPlanned
- AA17Quantum backtracking and tree-search methodsPlanned
- AA18Formula evaluation and span-program viewpointsPlanned
- AA19Quantum dynamic programming and graph problemsPlanned
- AA20Quantum learning theory and sample complexityPlanned
- AA21Quantum neural network models and barren plateausPlanned
- AA22Quantum generative modelling and Born machinesPlanned
- AA23Quantum chemistry and electronic structure workflowsPlanned
- AA24Quantum PDE/ODE ideas and differential-equation algorithmsPlanned
- AA25Quantum finance and stochastic modellingPlanned
- AA26Quantum methods for scientific optimisation and energy systemsPlanned
- AA27Query adversary and lower-bound techniquesPlanned
- AA28Hamiltonian simulation algorithms beyond product formulasPlanned
- AA29Precision, condition-number and fault-tolerance costsPlanned
- AA30Dequantisation, quantum-inspired classical algorithms and honest baselinesPlanned
- S01Classical cryptography refresher: symmetric keys and hashesPlanned
- S02Public-key cryptography: RSA, ECC and finite groupsPlanned
- S03Key exchange, KEMs, certificates and digital signaturesPlanned
- S04Security notions, threat modelling and threat timelinesPlanned
- S05Quantum computing threat to RSA and ECCPlanned
- S06Shor’s algorithm as a cryptanalytic threatPlanned
- S07Grover search and symmetric-key security marginsPlanned
- S08Harvest-now-decrypt-later and information lifetimePlanned
- S09Introduction to quantum communicationPlanned
- S10Measurement bases, no-cloning and channel modelsPlanned
- S11QKD versus post-quantum cryptographyPlanned
- S12BB84: states, bases and siftingPlanned
- S13BB84: error rates, intercept–resend and noisePlanned
- S14Finite-key statistics, confidence and leakagePlanned
- S15Error reconciliation and privacy amplificationPlanned
- S16Authentication, side channels and QKD operational limitsPlanned
- S17E91, entanglement-based QKD and CHSH contextPlanned
- S18Decoy-state and measurement-device-independent QKDPlanned
- S19Security evaluation of QKD simulationsPlanned
- S20PQC design goals and underlying hard problemsPlanned
- S21ML-KEM and FIPS 203: learning and safe librariesPlanned
- S22ML-DSA and FIPS 204: signature verificationPlanned
- S23SLH-DSA and FIPS 205: hash-based signaturesPlanned
- S24PQC integration, hybrid key establishment and interoperabilityPlanned
- S25Cryptographic inventories, crypto-agility and migration planningPlanned
- S26Migration capstone: standards, risk and technical assurancePlanned
- X01Quantum channels, density matrices and mixed statesPlanned
- X02Noise representations: Kraus maps and CPTP channelsPlanned
- X03Quantum process tomography and state estimationPlanned
- X04Information measures and quantum entropyPlanned
- X05Bell inequalities, nonlocal games and contextualityPlanned
- X06Fault-tolerant thresholds and logical qubitsPlanned
- X07Stabilizer formalism and Clifford circuitsPlanned
- X08Quantum error correction: repetition and surface codesPlanned
- X09Syndrome extraction and decoding basicsPlanned
- X10Logical gates, transversal gates and magic statesPlanned
- X11Error mitigation: ZNE, PEC and measurement mitigationPlanned
- X12Randomised benchmarking and device characterisationPlanned
- X13Hamiltonian complexity and simulation limitsPlanned
- X14Resource estimation and space–time costPlanned
- X15Distributed quantum computing and quantum networksPlanned
- X16Quantum communications protocols beyond QKDPlanned
- X17Quantum sensing and metrologyPlanned
- X18Quantum machine learning research directionsPlanned
- X19AI workloads and quantum algorithm mappingsPlanned
- X20Quantum-inspired classical optimisationPlanned
- X21Applications: energy, logistics and schedulingPlanned
- X22Quantum software and research reproducibilityPlanned
- X23Research methodology: falsifiable advantage claimsPlanned
- X24Open challenges, literature reading and reproducible projectsPlanned