Explore the book
The book has six complementary volumes, including an advanced algorithm atlas, plus a collection of protocol and data-tool guides. 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.
177 chapters · 112 lessons available now
- F01Classical Computing versus Quantum ComputingCore
- F02Introduction to Quantum InformationCore
- F03Essential Mathematics: Complex NumbersCore
- F04Vectors, Matrices and Linear AlgebraCore
- F05Dirac Notation: Kets and BrasCore
- F06Probability, Amplitudes and NormalisationCore
- F07Understanding QubitsCore
- F08SuperpositionCore
- F09Quantum MeasurementCore
- F10Quantum Phase and InterferenceCore
- F11The Bloch SphereCore
- F12Multiple Qubits and Tensor ProductsCore
- F13Entanglement and Bell StatesCore
- F14Quantum Reversibility and the No-Cloning PrincipleCore
- F15Introduction to Quantum GatesCore
- F16Pauli Gates and the Hadamard GateCore
- F17Phase and Rotation GatesCore
- F18Controlled Gates and CNOTCore
- F19Constructing Quantum CircuitsCore
- F20Quantum Oracles and Phase KickbackCore
- F21Measuring and Simulating Quantum CircuitsCore
- F22Quantum Noise and Hardware LimitationsCore
- F23Classical versus Quantum Algorithmic ComplexityCore
- F24Quantum Queries and OraclesCore
- F25How Quantum Algorithms Use InterferenceCore
- F26First Complete Quantum AlgorithmCore
- P01Programming environments: Python, notebooks, SDK choicesCore
- P02Quantum software architecture and clean project setupPlanned
- P03Toolchain reproducibility: packages, versions, environmentsPlanned
- P04Quantum circuits as code: qubits, registers and gatesCore
- 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: inputs, outputs and assumptionsPlanned
- P10Classical–quantum control and workflow orchestrationPlanned
- P11Statevector and unitary verification techniquesUndergraduate
- P12Probabilistic assertions and confidence intervalsUndergraduate
- P13Property-based and metamorphic quantum testsUndergraduate
- P14Debugging quantum logic and circuit defectsUndergraduate
- P15Test-driven circuit development and mutation testingUndergraduate
- P16Backend abstraction and simulation choicesPlanned
- P17Compilation and transpilation fundamentalsUndergraduate
- P18Native gates, decomposition and qubit connectivityPlanned
- P19Circuit depth, width, swap overhead and resource reportsPlanned
- P20Noise models, backend constraints and execution budgetsUndergraduate
- 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?Core
- A02Deutsch’s AlgorithmCore
- A03Deutsch–Jozsa AlgorithmCore
- A04Bernstein–Vazirani AlgorithmCore
- A05Simon’s AlgorithmUndergraduate
- A06Grover’s Search AlgorithmCore
- A07Amplitude AmplificationUndergraduate
- A08Quantum CountingUndergraduate
- A09Quantum Amplitude EstimationUndergraduate
- A10Quantum Walk AlgorithmsUndergraduate
- A11Quantum Fourier TransformUndergraduate
- A12Quantum Phase EstimationUndergraduate
- A13Order FindingUndergraduate
- A14Shor’s Factoring AlgorithmUndergraduate
- A15Hidden Subgroup ProblemsUndergraduate
- A16Introduction to Optimisation ProblemsCore
- A17QUBO and Ising ModelsUndergraduate
- A18Quantum Approximate Optimisation AlgorithmUndergraduate
- A19Variational Quantum EigensolverUndergraduate
- A20Quantum AnnealingUndergraduate
- A21Quantum Optimisation and Classical BaselinesCore
- A22Hamiltonian SimulationUndergraduate
- A23Trotter–Suzuki MethodsUndergraduate
- A24Linear Combination of UnitariesResearch
- A25QubitizationResearch
- A26HHL Quantum Linear Systems AlgorithmUndergraduate
- A27Block EncodingResearch
- A28Quantum Singular Value TransformationResearch
- A29Quantum Machine LearningUndergraduate
- A30Quantum KernelsUndergraduate
- A31Variational Quantum ClassifiersUndergraduate
- A32Quantum Sampling AlgorithmsUndergraduate
- A33Applications in Cryptography and SecurityCore
- A34Quantum Algorithms in Real-World OptimisationCore
- A35Quantum Advantage and ComplexityUndergraduate
- A36Noise and Resource EstimationUndergraduate
- A37Error Mitigation and Error CorrectionUndergraduate
- A38Fault-Tolerant Algorithm ConsiderationsResearch
- A39Quantum versus Classical BenchmarkingCore
- A40Open Research ChallengesResearch
- AA01Adiabatic quantum computation and algorithmic equivalencesResearch
- AA02Quantum minimum finding (Dürr–Høyer)Undergraduate
- AA03Amplitude estimation variants and modern iterative approachesUndergraduate
- AA04Quantum signal processing and polynomial transformationsResearch
- AA05Quantum eigenvalue transformation and spectral filteringResearch
- AA06Quantum singular value transformation applicationsResearch
- AA07Quantum linear-algebra improvements and input/output assumptionsResearch
- AA08Quantum principal components and spectral methodsResearch
- AA09Quantum recommendation and nearest-neighbour ideasResearch
- AA10Quantum gradient and derivative estimationResearch
- AA11Quantum approximate counting and mean estimationUndergraduate
- AA12Quantum Monte Carlo integration and risk estimationUndergraduate
- AA13Quantum Gibbs-state preparation and thermal samplingResearch
- AA14Quantum Metropolis methods and thermalisationResearch
- AA15Quantum walk search on graphs and spatial searchUndergraduate
- AA16Element distinctness and collision problemsUndergraduate
- AA17Quantum backtracking and tree-search methodsResearch
- AA18Formula evaluation and span-program viewpointsResearch
- AA19Quantum dynamic programming and graph problemsResearch
- AA20Quantum learning theory and sample complexityResearch
- AA21Quantum neural network models and barren plateausResearch
- AA22Quantum generative modelling and Born machinesUndergraduate
- AA23Quantum chemistry and electronic structure workflowsUndergraduate
- AA24Quantum PDE/ODE ideas and differential-equation algorithmsResearch
- AA25Quantum finance and stochastic modellingUndergraduate
- AA26Quantum methods for scientific optimisation and energy systemsUndergraduate
- AA27Query adversary and lower-bound techniquesResearch
- AA28Hamiltonian simulation algorithms beyond product formulasResearch
- AA29Precision, condition-number and fault-tolerance costsResearch
- AA30Dequantisation, quantum-inspired classical algorithms and honest baselinesUndergraduate
- 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
- T01Quantum teleportationCore
- T02Superdense codingCore
- T03The Hadamard testUndergraduate
- T04The swap testCore
- T05Quantum random-access memoryUndergraduate
- T06Classical shadowsUndergraduate
- T07Regev’s factoring algorithmResearch