Studying at York
Quantum Computation - COM00042H
Module summary
The aim of this module is to introduce the theory of quantum computation. In it we will learn about the pioneering quantum algorithms that promise a qualitative leap in computation power over conventional computers.
Module will run
| Occurrence | Teaching period |
|---|---|
| A | Semester 2 2024-25 |
Module aims
Introducing both the promise and limitations of quantum computation. Gate operations, evolving quantum states, calculating the result of measurements on quantum states, designing and analyzing quantum computational circuits, key algorithms (e.g., Shor's, Grover's and the Deutsch-Jozsa algorithms).
Module learning outcomes
-
Articulate both the promise and limitations of quantum computation.
-
Apply some of the many concepts and techniques in quantum computation (e.g., applying gate operations and evolving quantum states, calculating the result of measurements on quantum states, designing and analyzing quantum computational circuits);
-
Explain some of the key algorithms (e.g., Shor's, Grover's and the Deutsch-Jozsa algorithms) and their implications, and are able to simulate these algorithms on quantum states.
Indicative assessment
| Task | % of module mark |
|---|---|
| Online Exam -less than 24hrs (Centrally scheduled) | 100 |
Special assessment rules
None
Indicative reassessment
| Task | % of module mark |
|---|---|
| Online Exam -less than 24hrs (Centrally scheduled) | 100 |
Module feedback
Feedback is provided through work in practical sessions, and after the final assessment as per normal University guidelines.
Indicative reading
*** G. Benenti, et al., Principles of Quantum Computation and Information, vol I, World Scientific, 2004
*** G. Benenti, et al., Principles of Quantum Computation and Information, vol II, World Scientific, 2007
*** P. Kaye, et al., An Introduction to Quantum Computing, Oxford University Press, 2007