CIS 478/678
Introduction to Quantum Computation  
Spring 2013

Tuesday and Thursday, 0930 -- 1050, 4-206 Tech Room SciTech

Prof. Howard A. BLAIR


Instructor : Prof. Howard A. BLAIR


NOTICES:


Course Objective and Approach

The goal of this course is to equip participants with an exact and rigorous model of controllable quantum state evolution. The course will enable participants to evaluate claims made about the consequences of quantum computing and claims made about the consequences of quantum mechanical principles for advancing technology.


Prerequisites

Prerequisites by course: CIS 275 and MAT 296. The following is also recommended: Multi-variable calculus and/or fundamentals of linear algebra; i.e. MAT 397 or MAT 331. (Math background topics beyond those of MAT 296 and CIS 275 will be briefly reviewed during the course as they are needed.)

Prerequisites by topic:

These topics will be briefly reviewed during the course as they are needed.


Topics:
  • A brief history of quantum computing
  • Computational view of ordinary differential equations
  • Hamiltonians
  • Classical and quantum state evolution
  • Qubits and quantum registers
  • Classical and quantum circuits
  • Measurement
  • Superdense coding
  • Classical and quantum dynamical systems
  • Reasoning about state evolution with quantum logic


Bibliography:
  • Nielsen, M.A. & Chuang, I. Quantum Computation and Quantum Information. Cambridge University Press, 2000. ISBN 0-521-63503-9 (Paperback). Required
  • Hirvensalo, Mika. Quantum Computing, 2 ed. Springer-Verlag, 2004. ISBN 3-540-40704-9. Recommended
  • Albert, D.Z. Quantum Mechanics and Experience. Harvard University Press, 1992. ISBN 0-674-74113-7 (Paperback). Recommended


Course Outcomes:

This is an analytical and computational course that uses elementary calculus and linear algebra to model the phenomena of quantum dynamical systems. The specific educational outcomes are to be able to:


Outcome Measurement:

The grade will be based on the assignments (see below in the calendar of topics), which will be equally weighted, and occasional in-class quizzes that will have the weight of an assignment. (Quizzes will be determined as, and if, the need arises.) Assignments will be due in class one week after the assignment is announced, unless otherwise specified. Graduate students will be required to complete an expository paper on Hirvensalo'presentation of Shor's factoring algorithm.


Calendar of Topics: Approximately week by week. Assumes 14.5 week semester with 3 weeks distributed through the semester for review of material already covered, discussion of programming assignments, and quizzes.