Courses
  /  
Descriptions
EECS 395: Quantum Computation

Quarter Offered

Spring : 2-3:20 TuTh ; Yuen

Prerequisites

?Gen-Eng 205-1 or 206-1 or any linear algebra course?, Phys 135-2 or equivalent; or just ?permission of instructor

Description

The basic mathematics of quantum mechanics will be reviewed for application to quantum computation. Classical physical computation (not with digital circuits) will be discussed, in particular reference to computational complexity. Computation with quantum qubit circuits will be developed. Glover's search algorithm and Shor's factorization algorithms will be covered. The more recent Adiabatic Quantum Computation will be discussed, together with a general perspective on quantum and physical computation in general.

COURSE INSTRUCTOR: Prof. Horace Yuen

TEXTBOOK: 'Quantum Computing: A Gentle Introduction', MIT Press, 2014 by E. Rieffel and W. Polak

COURSE OUTLINE: The basic mathematics of quantum mechanics will be reviewed for application to quantum computation. Classical physical computation (not with digital circuits) will be discussed, in particular reference to computational complexity. Computation with quantum qubit circuits will be developed. Glover's search algorithm and Shor's factorization algorithms will be covered. The more recent Adiabatic Quantum Computation will be discussed, together with a general perspective on quantum and physical computation in general.

COURSE CONTENT:

  1. Dirac linear algebra formulation of quantum mechanics; formalism and interpretation.
  2. Turing machine classical computation and algorithm complexity.
  3. Physical computation and linear space computation, complexity.
  4. Qubits and quantum entanglement. Quantum circuits and complexity.
  5. Grover's algorithm and generalizations, its possible practical use and limits. 
  6. Shor's algorithm and implications in cryptography.
  7. Adiabatic quantum computation and quantum annealing.

ENGINEERING CONTENT:  100%