Skip to content
Quantum ComputingAN INTERACTIVE OPEN TEXTBOOK
charithj.com.au

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.

IDChapterAvailability
F01Classical Computing versus Quantum ComputingAvailable
F02Introduction to Quantum InformationAvailable
F03Essential Mathematics: Complex NumbersAvailable
F04Vectors, Matrices and Linear AlgebraAvailable
F05Dirac Notation: Kets and BrasAvailable
F06Probability, Amplitudes and NormalisationAvailable
F07Understanding QubitsAvailable
F08SuperpositionAvailable
F09Quantum MeasurementAvailable
F10Quantum Phase and InterferenceAvailable
F11The Bloch SphereAvailable
F12Multiple Qubits and Tensor ProductsAvailable
F13Entanglement and Bell StatesAvailable
F14Quantum Reversibility and the No-Cloning PrincipleAvailable
F15Introduction to Quantum GatesAvailable
F16Pauli Gates and the Hadamard GateAvailable
F17Phase and Rotation GatesAvailable
F18Controlled Gates and CNOTAvailable
F19Constructing Quantum CircuitsAvailable
F20Quantum Oracles and Phase KickbackAvailable
F21Measuring and Simulating Quantum CircuitsAvailable
F22Quantum Noise and Hardware LimitationsAvailable
F23Classical versus Quantum Algorithmic ComplexityAvailable
F24Quantum Queries and OraclesAvailable
F25How Quantum Algorithms Use InterferenceAvailable
F26First Complete Quantum AlgorithmAvailable
IDChapterAvailability
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
IDChapterAvailability
A01What Makes a Quantum Algorithm Different?Available
A02Deutsch’s AlgorithmAvailable
A03Deutsch–Jozsa AlgorithmAvailable
A04Bernstein–Vazirani AlgorithmAvailable
A05Simon’s AlgorithmAvailable
A06Grover’s Search AlgorithmAvailable
A07Amplitude AmplificationAvailable
A08Quantum CountingAvailable
A09Quantum Amplitude EstimationAvailable
A10Quantum Walk AlgorithmsAvailable
A11Quantum Fourier TransformAvailable
A12Quantum Phase EstimationAvailable
A13Order FindingAvailable
A14Shor’s Factoring AlgorithmAvailable
A15Hidden Subgroup ProblemsAvailable
A16Introduction to Optimisation ProblemsAvailable
A17QUBO and Ising ModelsAvailable
A18Quantum Approximate Optimisation AlgorithmAvailable
A19Variational Quantum EigensolverAvailable
A20Quantum AnnealingAvailable
A21Quantum Optimisation and Classical BaselinesAvailable
A22Hamiltonian SimulationAvailable
A23Trotter–Suzuki MethodsAvailable
A24Linear Combination of UnitariesAvailable
A25QubitizationAvailable
A26HHL Quantum Linear Systems AlgorithmAvailable
A27Block EncodingAvailable
A28Quantum Singular Value TransformationAvailable
A29Quantum Machine LearningAvailable
A30Quantum KernelsAvailable
A31Variational Quantum ClassifiersAvailable
A32Quantum Sampling AlgorithmsAvailable
A33Applications in Cryptography and SecurityAvailable
A34Quantum Algorithms in Real-World OptimisationAvailable
A35Quantum Advantage and ComplexityAvailable
A36Noise and Resource EstimationAvailable
A37Error Mitigation and Error CorrectionAvailable
A38Fault-Tolerant Algorithm ConsiderationsAvailable
A39Quantum versus Classical BenchmarkingAvailable
A40Open Research ChallengesAvailable
IDChapterAvailability
AA01Adiabatic quantum computation and algorithmic equivalencesAvailable
AA02Quantum minimum finding (Dürr–Høyer)Available
AA03Amplitude estimation variants and modern iterative approachesAvailable
AA04Quantum signal processing and polynomial transformationsAvailable
AA05Quantum eigenvalue transformation and spectral filteringAvailable
AA06Quantum singular value transformation applicationsAvailable
AA07Quantum linear-algebra improvements and input/output assumptionsAvailable
AA08Quantum principal components and spectral methodsAvailable
AA09Quantum recommendation and nearest-neighbour ideasAvailable
AA10Quantum gradient and derivative estimationAvailable
AA11Quantum approximate counting and mean estimationAvailable
AA12Quantum Monte Carlo integration and risk estimationAvailable
AA13Quantum Gibbs-state preparation and thermal samplingAvailable
AA14Quantum Metropolis methods and thermalisationAvailable
AA15Quantum walk search on graphs and spatial searchAvailable
AA16Element distinctness and collision problemsAvailable
AA17Quantum backtracking and tree-search methodsAvailable
AA18Formula evaluation and span-program viewpointsAvailable
AA19Quantum dynamic programming and graph problemsAvailable
AA20Quantum learning theory and sample complexityAvailable
AA21Quantum neural network models and barren plateausAvailable
AA22Quantum generative modelling and Born machinesAvailable
AA23Quantum chemistry and electronic structure workflowsAvailable
AA24Quantum PDE/ODE ideas and differential-equation algorithmsAvailable
AA25Quantum finance and stochastic modellingAvailable
AA26Quantum methods for scientific optimisation and energy systemsAvailable
AA27Query adversary and lower-bound techniquesAvailable
AA28Hamiltonian simulation algorithms beyond product formulasAvailable
AA29Precision, condition-number and fault-tolerance costsAvailable
AA30Dequantisation, quantum-inspired classical algorithms and honest baselinesAvailable
IDChapterAvailability
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
IDChapterAvailability
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

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.

IDExperimentStatus
L01Qubit ExplorerOpen studio
L02Quantum Gate PlaygroundOpen studio
L03Superposition and InterferenceOpen studio
L04Entanglement ExplorerOpen studio
L05Deutsch–Jozsa ExplorerOpen studio
L06Grover Search ExplorerOpen studio
L07Quantum Fourier TransformOpen studio
L08Quantum Phase EstimationOpen studio
L09Shor’s AlgorithmPlanned
L10QAOA ExplorerPlanned
L11VQE ExplorerPlanned
L12Quantum Linear Systems / HHLPlanned
L13Quantum basis and measurement explorerPlanned
L14Reversible Boolean oracle builderPlanned
L15Shot noise and confidence-interval labOpen studio
L16Circuit debugger and minimal repairPlanned
L17Parameterised circuits and API testsPlanned
L18Backend execution and result parserPlanned
L19Transpilation and connectivity visualiserPlanned
L20Circuit-depth and resource inspectorPlanned
L21Property/metamorphic test sandboxPlanned
L22Noise model and reproducibility studioPlanned
L23QUBO / Ising encoding workbenchPlanned
L24Classical vs quantum comparison benchPlanned
L25Optimiser comparison: SPSA vs DEPlanned
L26Grover oracle synthesis cost explorerPlanned
L27Quantum walks on small graphsPlanned
L28Amplitude estimation and countingPlanned
L29Hamiltonian time evolutionPlanned
L30QSVT polynomial transform explorerPlanned
L31BB84 intercept–resend and QBER labOpen studio
L32BB84 finite-key uncertainty labPlanned
L33Noise-versus-adversary evidence labPlanned
L34Entanglement-based QKD explorerPlanned
L35PQC KEM practice notebookPlanned
L36PQC signature verification notebookPlanned
L37Cryptographic inventory/migration plannerPlanned
L38Error correction syndrome visualiserPlanned
L39Error mitigation comparison laboratoryPlanned
L40Quantum resource estimation studioPlanned