Module 12411 (2001)
Syllabus page 2001/2002
06-12411
Introduction to Molecular and Quantum Computation
Level M1
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus
The Module Description is a strict subset of this Syllabus Page. (The University module description has not yet been checked against the School's.)
Relevant Links
Outline
This module introduces the concepts and techniques of Quantum Computation. It also covers DNA computing and other forms of Molecular Computation (such as Excitable Media).
Aims
The aims of this module are to:
- give an introduction to Quantum Computation and its relation with algorithmic complexity
- give an introduction to DNA computing
- introduce the students to the concepts of chemical and biological computation
- give the students an understanding of the role of physics in computation
Learning Outcomes
| On successful completion of this module, the student should be able to: | Assessed by: | |
| 1 | explain the differences between classical computation, quantum and molecular computation | Examination |
| 2 | describe how to build quantum logic circuits | Examination |
| 3 | demonstrate an understanding of various molecular and quantum algorithms | Examination |
| 4 | demonstrate an understanding the basic concepts of quantum mechanics | Examination |
| 5 | understand the current practical attempts to build quantum and molecular computation devices | Examination |
| 6 | understand the principles of quantum cryptography and contrast with classical cryptography | Examination |
Restrictions, Prerequisites and Corequisites
Restrictions:
None
Prerequisites:
None
Co-requisites:
Teaching
Teaching Methods:
2 lectures/tutorials per week
Contact Hours:
Assessment
- Supplementary (where allowed): As the sessional assessment
- 2 hr open book examination (100%).
Recommended Books
| Title | Author(s) | Publisher, Date |
| Explorations in Quantum Computing | C P Williams & S H Clearwater | Springer-Verlag, 1998 |
| Computing with Cells and Atoms | C Calude & G Paun | Taylor & Francis, 2000 |
| Computation in Cellular and Molecular Biological Systems | R Paton & M Holcombe | World Scientific Publishing, |
Detailed Syllabus
- Turing machines and algorithmic complexity
- Quantum mechanics,notation, Schrodinger equation
- Quantum logic circuits
- Quantum superposition and entanglement
- Reversible computing>
- The Feynmann processor
- Quantum algorithms particularly Shor's and Grover's algorithms
- Quantum cryptography
- DNA computing, Adelman hamiltonian path problem
- Computation in non-linear excitable media
Last updated: 29 July 2001
Source file: /internal/modules/COMSCI/2001/xml/12411.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus