Skip to content

Master Lesson Plan

How to Use This Plan

The course allocates 45 lecture hours across four units (10 + 15 + 10 + 10). This master plan converts those hours into 45 self-contained one-hour lessons. Each lesson has its own detailed note PDF in the corresponding Unit-n folder, containing:

  • Learning outcomes for that hour
  • Formal definitions
  • Full mathematical development with derivations
  • 4–5 fully solved problems
  • Practice problems with answers
  • A one-page summary and a link to the interactive web platform for that unit

Pacing advice. A one-hour lesson note is intentionally denser than one hour of chalk-talk. Use the Explanation and Mathematics sections in class and set the Solved Problems section as guided self-study. The Unit interactive platform is designed to be opened live in class.

Unit-Wise Distribution

Unit Title Hours Lessons Weightage (indicative)
I Fundamentals of Quantum Computing 10 L01–L10 22 %
II Quantum Algorithms and Post-Quantum Security 15 L11–L25 34 %
III Quantum Machine Learning and Optimization 10 L26–L35 22 %
IV Quantum Simulation Tools and Platforms 10 L36–L45 22 %
Total 45 45 100 %

Unit I — Fundamentals of Quantum Computing (10 hours)

Hr Lesson Topic Key Ideas Delivered
1 L01 Introduction and Motivation Moore's law limits, reversible computation, classical vs quantum models, BQP, DiVincenzo criteria
2 L02 Linear Algebra I — Complex Vector Spaces and Dirac Notation \(\mathbb{C}^n\), kets, bras, linear independence, basis, spanning sets
3 L03 Linear Algebra II — Inner Products and Hilbert Spaces Inner product axioms, norm, orthonormality, Gram–Schmidt, Cauchy–Schwarz
4 L04 Linear Algebra III — Operators, Eigenvalues, Tensor Products Hermitian and unitary operators, spectral theorem, outer products, \(\otimes\)
5 L05 Qubits, Superposition and the Bloch Sphere Qubit postulate, global vs relative phase, Bloch coordinates
6 L06 Quantum Measurement and the Postulates Born rule, projective measurement, observables, expectation, collapse
7 L07 Single-Qubit Gates and the Circuit Model \(X,Y,Z,H,S,T\), rotation gates, circuit diagrams, unitarity, reversibility
8 L08 Multi-Qubit Gates and Entanglement CNOT, CZ, SWAP, Toffoli, Bell states, product vs entangled states, universality
9 L09 Quantum Parallelism, Interference and No-Cloning \(U_f\) oracle, evaluating \(f\) on all inputs, constructive/destructive interference, no-cloning proof
10 L10 Teleportation, Superdense Coding and Error Correction Teleportation protocol, superdense coding, bit-flip/phase-flip codes, Shor 9-qubit code

Unit I assessment checkpoint: a 20-mark class test after Hour 10 covering L01–L10.

Unit II — Quantum Algorithms and Post-Quantum Security (15 hours)

Hr Lesson Topic Key Ideas Delivered
11 L11 Quantum Oracles and Phase Kick-Back Query model, \(U_f\) construction, the \(\lvert-\rangle\) trick, phase kick-back
12 L12 The Deutsch Algorithm Constant vs balanced for \(n=1\), one query vs two
13 L13 The Deutsch–Jozsa Algorithm \(n\)-bit generalisation, Hadamard transform identity, exponential separation
14 L14 The Bernstein–Vazirani Algorithm Hidden string recovery, one query vs \(n\) queries
15 L15 Simon's Algorithm Hidden subgroup, linear system over \(\mathbb{F}_2\), exponential speed-up
16 L16 Number Theory Recap and the RSA Cryptosystem Euler totient, modular exponentiation, key generation, correctness proof
17 L17 Factorization Attack on RSA and Order Finding Reduction from factoring to period finding, classical difficulty
18 L18 The Quantum Fourier Transform DFT vs QFT, product-form derivation, \(O(n^2)\) circuit
19 L19 Quantum Phase Estimation Eigenvalue extraction, precision analysis, success probability
20 L20 Shor's Algorithm for Integer Factorization Full algorithm, continued fractions, worked factorisation of 15 and 21
21 L21 Grover's Algorithm — Oracle and Diffusion Amplitude amplification circuit, inversion about the mean
22 L22 Grover's Algorithm — Analysis and Optimality Rotation-in-2D picture, optimal \(\lfloor \pi\sqrt{N}/4 \rfloor\) iterations, lower bound
23 L23 Grover Applied to Cryptography — Hash Preimage Attacks Key search, preimage search, the "double your key length" rule
24 L24 The HHL Algorithm for Linear Systems Solving \(A\vec{x}=\vec{b}\), condition number, caveats
25 L25 Post-Quantum Cryptography — Kyber and PQ Signatures Lattices, LWE/MLWE, ML-KEM (Kyber), ML-DSA (Dilithium), SPHINCS+

Unit II assessment checkpoint: 30-mark test after Hour 25.

Unit III — Quantum Machine Learning and Optimization (10 hours)

Hr Lesson Topic Key Ideas Delivered
26 L26 Introduction to QML and Data Encoding Basis/amplitude/angle encoding, feature maps, PQCs, the four QML quadrants
27 L27 Quantum Kernel Methods and QSVM Kernel trick recap, quantum kernel estimation, SVM dual, QSVM pipeline
28 L28 Variational Quantum Classifier (VQC) Ansatz design, cost functions, hybrid optimisation loop
29 L29 Quantum Neural Networks and the Parameter-Shift Rule QNN architecture, analytic gradients, barren plateaus
30 L30 Quantum Convolutional Neural Networks (QCNN) Convolution and pooling layers on qubits, MERA connection
31 L31 Quantum Linear Regression Least squares via HHL, quantum-enhanced regression
32 L32 Quantum k-Means Clustering Swap test, distance estimation, the quantum Lloyd algorithm
33 L33 Quantum Boltzmann Machines Classical RBM recap, transverse-field Hamiltonian, training QBMs
34 L34 Quantum Approximate Optimization Algorithm (QAOA) QUBO/Ising mapping, cost and mixer Hamiltonians, Max-Cut worked end-to-end
35 L35 Quantum Annealing and the Adiabatic Model Adiabatic theorem, spectral gap, D-Wave, annealing vs QAOA

Unit IV — Quantum Simulation Tools and Platforms (10 hours)

Hr Lesson Topic Key Ideas Delivered
36 L36 The Quantum Software Landscape NISQ hardware, stack layers, OpenQASM, transpilation, simulator types
37 L37 IBM Qiskit I — Circuits and Simulation QuantumCircuit, Aer, Sampler/Estimator primitives, statevector
38 L38 IBM Qiskit II — Transpilation, Noise and Hardware Coupling maps, optimisation levels, noise models, error mitigation
39 L39 Google Cirq Devices, moments, cirq.Simulator, gate sets, qubit topologies
40 L40 PennyLane QNodes, devices, autodiff, interfaces with PyTorch/JAX
41 L41 Amazon Braket Managed service model, on-demand vs hybrid jobs, multi-vendor QPUs, cost model
42 L42 Microsoft Q# and the Quantum Development Kit Q# language, operations vs functions, resource estimation, Azure Quantum
43 L43 TensorFlow Quantum tfq layers, quantum data as tensors, hybrid Keras models
44 L44 TKET / pytket, XACC and ProjectQ Compiler-first frameworks, retargetable back ends, circuit optimisation passes
45 L45 Comparative Study, Benchmarking and Capstone Feature matrix, portability via OpenQASM 3, benchmarking metrics, capstone brief

Mapping of Lessons to Course Learning Outcomes

CLO Description Lessons
CLO 1 Principles of quantum mechanics relevant to computing L01–L10
CLO 2 Quantum algorithms and their applications L11–L25
CLO 3 Quantum optimisation techniques in problem solving L34, L35, and L26–L33
CLO 4 Practical skills in cryptography and machine learning L16–L17, L20, L23, L25–L33, L36–L45

Mapping of Lectures to Practicals

Practical (from the course outline) Hours Supporting Lessons
1. Install framework, basic circuits 3 L07, L36, L37
2. Bloch sphere visualisation 2 L05, L37
3. Superposition and entanglement 3 L05, L08, L37
4. Quantum teleportation 3 L10, L37
5. Deutsch–Jozsa 3 L11, L13
6. Grover's search 4 L21, L22
7. Quantum Fourier Transform 3 L18
8. QAOA 3 L34, L40
9. Quantum random numbers 4 L05, L06
10. Cross-platform comparison 2 L39–L45

Suggested Evaluation Scheme

Component Marks Timing
Internal Assessment — Test 1 (Units I–II) 15 After Hour 25
Internal Assessment — Test 2 (Units III–IV) 15 After Hour 45
Practical file and continuous evaluation 25 Continuous
Practical viva / end-semester practical exam 25 End of semester
End-semester theory examination 70 End of semester

Interactive Support

Each unit has a browser-based interactive platform in the folder Quantum Computing and its Applications/Interactive-Web-Platform/. Open index.html in any modern browser — no installation, no internet connection required.

Unit Platform What Students Practise
I unit1-qubit-lab.html Bloch sphere, gate action, state vectors, entanglement, measurement statistics
II unit2-algorithms-lab.html Deutsch–Jozsa, Bernstein–Vazirani, Grover, QFT, RSA/Shor factoring
III unit3-qml-lab.html Feature maps, kernels, VQC training, QAOA on Max-Cut, annealing
IV unit4-platforms-lab.html Circuit builder with code emission for Qiskit / Cirq / PennyLane / Q#