Useful links
This unit will provide an in-depth introduction to quantum computing and quantum algorithms. After defining the quantum computation models needed to rigorously design, analyse, and implement quantum algorithms, the unit will cover key quantum algorithmic primitives, as well as the computational speed-ups, complexity-theoretic and cryptographic implications, and applications of quantum computing. The unit will focus on their mathematical analysis and theoretical underpinnings of quantum algorithms, and complement these theoretical foundations by hands-on implementation and evaluation, using (classical) simulation of quantum programs.
| Study level | Postgraduate |
|---|---|
| Academic unit | Computer Science |
| Credit points | 6 |
|
Prerequisites:
?
|
None |
|---|---|
|
Corequisites:
?
|
None |
| Prohibitions:
?
|
COMP4210 |
| Assumed knowledge:
?
|
Discrete mathematics and probability (e.g. MATH1064 or equivalent); linear algebra (e.g. MATH1061 or equivalent), Models of Computation (COMP2022 or equivalent); Algorithm Design (COMP3027 or equivalent) |
The learning outcomes for this unit will be available two weeks before the first day of teaching.
This section lists the session, attendance modes and locations the unit is available in. There is a unit outline for each of the unit availabilities, which gives you information about the unit including assessment details and a schedule of weekly activities.
The outline is published 2 weeks before the first day of teaching. You can look at previous outlines for a guide to the details of a unit.
| Session | MoA ? | Location | Outline ? |
|---|---|---|---|
|
Semester 2 2027
|
Normal day | Camperdown/Darlington, Sydney |
Outline unavailable
|
Find your current year census dates
This refers to the Mode of attendance (MoA) for the unit as it appears when you’re selecting your units in Sydney Student. Find more information about modes of attendance on our website.
To help you understand common terms that we use at the University, we offer an online glossary.