Module 12411 (2005)
Syllabus page 2005/2006
06-12411
Introduction to Molecular and Quantum Computation
Level 4/M
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 | explain various molecular and quantum algorithms | Examination |
| 4 | outline the basic concepts of quantum mechanics | Examination |
| 5 | describe the current practical attempts to build quantum and molecular computation devices | Examination |
| 6 | compare the principles of quantum cryptography with classical cryptography | Examination |
Restrictions, Prerequisites and Corequisites
Restrictions:
None
Prerequisites:
None
Co-requisites:
None
Teaching
Teaching Methods:
2 lectures/tutorials per week
Contact Hours:
Assessment
- Supplementary (where allowed): As the sessional assessment
- 1.5 hr open book examination (100%).
Recommended Books
| Title | Author(s) | Publisher, Date |
| Quantum Computation and Quantum Information | Michael A Nielsen and Isaac L Chuang | Cambridge University Press, 2002 |
| 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
- Review of classical computation
- The Postulates of Quantum Mechanics
- Notion of a state vector; Dirac Notation
- Quantum Measurement and Probabilities
- Time-evolution of Quantum Systems; Unitarity
- Composite Quantum Systems
- Introducing Qubits
- Notion of a Qubit
- How much information can a qubit store?
- Superposition and Entanglement
- The No-Cloning Theorem
- Quantum logic circuits
- Importance of Reversibility
- Basic elements of quantum logic circuits
- Analysing quantum circuits
- Quantum Algorithms
- The Quantum Fourier Transform
- Grover's Search Algorithm
- Shor's Factorisation Algorithm
- Quantum Communications
- Quantum Teleportation
- Quantum Cryptography
- Molecular Computation
- DNA computing
- Adelman's hamiltonian path problem
- Computation in non-linear excitable media
Last updated: 15 Sep 2005
Source file: /internal/modules/COMSCI/2005/xml/12411.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus