CSC3133 : Quantum Algorithms (Inactive)
- Inactive for Year: 2025/26
- Module Leader(s): Dr Jonte Hance
- Lecturer: Dr Ittoop Puthoor
- Owning School: Computing
- Teaching Location: Newcastle City Campus
- Capacity limit: 500 student places
Semesters
Your programme is made up of credits, the total differs on programme to programme.
| Semester 2 Credit Value: | 10 |
| ECTS Credits: | 5.0 |
| European Credit Transfer System | |
Aims
Quantum computing is rapidly developing as one of the most important areas in computing – however, the algorithms which we hope to deploy on quantum computers, both now on noisy intermediate-scale quantum (NISQ) devices, and in future on error-corrected “ideal” systems, require both an understanding of the formalism of quantum information, and an understanding of key properties of quantum systems which such algorithms then make use of (e.g., superposition, entanglement, contextuality). In this course, building on the tools provided by CSC3132, we introduce key quantum algorithms (both for NISQ and error-corrected systems), and dive “under the hood” to look a bit more at the features which seem to power the “quantum advantage” these quantum algorithms should give over classical algorithms aiming to solve the same problem.
Outline Of Syllabus
Review of the quantum formalism and quantum circuits
Basic Quantum Algorithms (e.g., Deutsch-Jozsa)
Grover’s Algorithm
Quantum Fourier Transform
Shor’s algorithms
Approximation of general unitaries (e.g., Solovay-Kitaev theorem)
Hybrid Quantum-Classical (e.g., Variational Quantum Algorithms)
Quantum Annealing/Simulation
Contextuality and Quantum Advantage
Quantum Computing in Practice
Teaching Methods
Teaching Activities
| Category | Activity | Number | Length | Student Hours | Comment |
|---|---|---|---|---|---|
| Guided Independent Study | Assessment preparation and completion | 10 | 1:00 | 10:00 | Complete weekly online problems. |
| Scheduled Learning And Teaching Activities | Lecture | 10 | 1:00 | 10:00 | Lectures (in person). |
| Guided Independent Study | Assessment preparation and completion | 1 | 20:00 | 20:00 | Preparation for final examination. |
| Scheduled Learning And Teaching Activities | Practical | 5 | 2:00 | 10:00 | Practical sessions using tools (e.g., Qiskit, Pennylane) to write and implement quantum algorithms. |
| Guided Independent Study | Independent study | 5 | 2:00 | 10:00 | Complete lab practicals. |
| Guided Independent Study | Independent study | 10 | 3:00 | 30:00 | Revise lecture materials. |
| Guided Independent Study | Independent study | 5 | 2:00 | 10:00 | Background reading. |
| Total | 100:00 |
Teaching Rationale And Relationship
The lectures convey the key theoretical concepts, algorithms, and illustrative examples that will be tried and extended upon in the lab. Quantum computing is quite counterintuitive, and therefore a solid understanding of its theory is required – this cannot be learnt by experimentation. The computer practicals give students hands-on experience with quantum circuits run on simulators or quantum computers, to reinforce the theoretical concepts delivered in the lectures.
Assessment Methods
The format of resits will be determined by the Board of Examiners
Exams
| Description | Length | Semester | When Set | Percentage | Comment |
|---|---|---|---|---|---|
| Written Examination | 90 | 2 | A | 60 | N/A |
Other Assessment
| Description | Semester | When Set | Percentage | Comment |
|---|---|---|---|---|
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 1 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 2 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 3 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 4 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 5 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 6 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 7 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 8 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 9 |
| Prob solv exercises | 2 | M | 4 | Weekly online assessed question set 10 |
Assessment Rationale And Relationship
The main aim of the written exam is to assess the student’s understanding of the theory of quantum computing and quantum algorithms delivered through the lectures – this is necessary to measure to what extent the subject is mastered. The ten weekly problem sets focus on the student’s ability to apply theory to practice and solve simple problems on the quantum algorithms presented at lectures.
Reading Lists
Timetable
- Timetable Website: www.ncl.ac.uk/timetable/
- CSC3133's Timetable