Skip to main content

EEE 6516 Quantum Computing

EEE 6516 Quantum Computing (Postgraduate).

Public teaching materials for the postgraduate course EEE 6516 Quantum Computing. Lecture slides are published lecture by lecture once every image in them is cleared for public distribution.

Course information

CourseEEE 6516 Quantum Computing (EEE 6516)
LevelPostgraduate
Credit hoursTwo lectures of 75 minutes per week (20 lectures plus an introductory class)
InstructorSajid Muhaimin Choudhury

Course description

This course builds quantum computing from what an EEE graduate already knows: linear algebra, phasors, signals, probability and digital logic. No background in quantum mechanics is assumed. Every idea is also tested in simulation, using free, open-source software that runs on your own laptop. Course content: introduction to quantum computing; postulates of quantum mechanics; qubits and single-qubit gates; operators and quantum measurement; quantum information processing, superposition, entanglement, the no-cloning theorem and quantum teleportation; quantum circuits, controlled operations and measurement, universal quantum gates; quantum algorithms (Deutsch–Jozsa, Grover, Shor, the quantum Fourier transform and phase estimation); density matrices and the Bloch-sphere representation; quantum error correction and fault-tolerant architecture; physical realisation of quantum computers.

Prerequisites

  • Python, linear algebra and probability at the level of a BSc in EEE.
  • No quantum mechanics is assumed. Chapter 1 builds the mathematical toolkit (complex vectors, Dirac notation, operators and eigenvalues).

Learning outcomes

  • CO1 Apply the postulates of quantum mechanics and the linear algebra of qubits to compute states, gate actions, measurement probabilities and expectation values of single- and multi-qubit systems, including entangled and mixed states.
  • CO2 Analyse quantum algorithms (Deutsch–Jozsa, Bernstein–Vazirani, Grover, QFT, phase estimation, Shor), error-correcting codes and physical qubit platforms, and evaluate their resource costs and limitations against classical baselines and noise.
  • CO3 Implement, simulate and verify multi-qubit circuits and quantum dynamics with open-source simulators, including noise, interpret the results statistically, and communicate a reproducible simulation study.

Major subject areas

  • Why quantum computing; the mathematical toolkit
  • Postulates and the single qubit
  • Multiple qubits and quantum circuits
  • Entanglement and quantum information
  • Query algorithms and Grover search
  • Quantum Fourier transform, phase estimation and Shor’s algorithm
  • Density matrices and noise
  • Quantum error correction and fault tolerance
  • Physical realisations

Textbooks and references

  • Chapter handouts written by the instructor are the primary course material.

Software

  • Python with NumPy, Qiskit and Qiskit Aer, and QuTiP; Cirq and PennyLane are shown as alternatives. All free, open-source and run locally.

Assessment

  • Class tests: 15 % (three tests, 5 % each, outside lecture time)
  • Midterm assignment: 25 % (individual simulation study)
  • Final project: 30 % (groups of 2–3; reproduce and extend a published result by simulation)
  • Term final: 30 %

Lecture plan

Twenty lectures of 75 minutes in nine chapters, two lectures per week, after an introductory class in Week 1. Week 7 is a midterm-assignment week and Week 13 is for final-project presentations.

Download: EEE 6516 Quantum Computing lecture plan (PDF)

WeekUnitTitleTopicsOutcomesLabsReadingsPublic slides
1L00Introduction to quantum computing and to the courseIntroduction to quantum computing and to the course (course page, Weekly Plan) (published)Not stated—Not statedSlides (PDF)
2L01Why quantum computingWhy quantum computing: bits vs qubits, landscape, course and toolchainNot stated—Chapter 1 handoutSlides (PDF)
2L02Complex vector spaces for engineersComplex vector spaces for engineers: Dirac notation, operators, eigenvaluesNot stated—Chapter 1 handoutSlides (PDF)
3L03Postulates IPostulates I: states, superposition, the Born rule, measurementNot stated—Chapter 2 handoutSlides (PDF)
3L04Single-qubit gates and the Bloch sphere; evolution under a HamiltonianSingle-qubit gates and the Bloch sphere; evolution under a HamiltonianNot stated—Chapter 2 handoutSlides (PDF)
4L05Observables, expectation values, measurement bases; sampling and shot noiseObservables, expectation values, measurement bases; sampling and shot noiseNot stated—Chapter 2 handoutSlides (PDF)
4L06Composite systemsComposite systems: tensor products, ordering conventions, two-qubit gatesNot stated—Chapter 3 handoutSlides (PDF)
5L07The circuit modelThe circuit model: measurement, universality, reversible logic, transpilation; the same circuit in Qiskit, Cirq and PennyLaneNot stated—Chapter 3 handoutSlides (PDF)
5L08EntanglementEntanglement: Bell states, no-cloning, Bell measurementNot stated—Chapter 4 handoutSlides (PDF)
6L09Teleportation, superdense coding and the CHSH inequalityTeleportation, superdense coding and the CHSH inequalityNot stated—Chapter 4 handoutSlides (PDF)
6L10Oracles and phase kickbackOracles and phase kickback: Deutsch, Deutsch–Jozsa, Bernstein–VaziraniNot stated—Chapter 5 handoutSlides (PDF)
8L11Grover search and amplitude amplificationGrover search and amplitude amplificationNot stated—Chapter 5 handoutSlides (PDF)
8L12The quantum Fourier transformThe quantum Fourier transformNot stated—Chapter 6 handoutSlides (PDF)
9L13Quantum phase estimationQuantum phase estimationNot stated—Chapter 6 handoutSlides (PDF)
9L14Order finding and Shor’s algorithmOrder finding and Shor’s algorithmNot stated—Chapter 6 handoutSlides (PDF)
10L15Density matrices, partial trace, the Bloch ballDensity matrices, partial trace, the Bloch ballNot stated—Chapter 7 handoutSlides (PDF)
10L16Quantum channels and noise; T1/T2; noisy simulationQuantum channels and noise; T1/T2; noisy simulationNot stated—Chapter 7 handoutSlides (PDF)
11L17Error correctionError correction: repetition codes, syndromes, the Shor codeNot stated—Chapter 8 handoutSlides (PDF)
11L18Stabilisers, the surface code and fault toleranceStabilisers, the surface code and fault toleranceNot stated—Chapter 8 handoutSlides (PDF)
12L19Superconducting qubits from the harmonic oscillatorSuperconducting qubits from the harmonic oscillatorNot stated—Chapter 9 handout—
12L20Trapped ions, photons, neutral atoms and spins; comparing platformsTrapped ions, photons, neutral atoms and spins; comparing platformsNot stated—Chapter 9 handout—

Slides are published lecture by lecture after copyright clearance; the plan may be adjusted during the term.

Rights and reuse

Copyright (c) 2026 Sajid Muhaimin Choudhury. All rights reserved.

Third-party figures are reproduced only where their licence or a permission allows public distribution; each is credited where it appears. Figures without cleared rights are not reproduced and are cited with a link to their source instead.

Release qc-2026-10-15, prepared 2026-10-15.

Downloads

Nothing is published here yet.