Quantum Computing (CS5100)

Syllabus

• Introduction to Quantum Computing.
• Deutsch's algorithm and classical and quantum circuits .
• Deutsch-Jozsa and Bernstein-Vazirani algorithms.
• Simon's algorithm.
• Fourier transform and phase estimation.
• Shor's factorization algorithm and order finding.
• Hidden Subgroup Problem.
• Grover's search and amplitude amplification.
• Quantum query lower bounds.
• Quantum algorithms using random walks, Hamiltonian Simulation and the HHL algorithm.
• Other advanced topics if time permits...

Evaluations

Textbook and References

• Michael Nielsen and Isaac Chuang, Quantum Computation and Quantum Information.
• Phillip Kaye, Raymond Laflamme and Michele Mosca, An Introduction to Quantum Computing.
• Ronald de Wolf, Quantum Computing: Lecture Notes.
• Richard Feynman, Feynman Lectures on Computation (1996).
• Other quantum courses: Andrew Childs (University of Maryland), John Watrous (University of Waterloo), Rajat Mittal (IIT Kanpur), Ryan O'Donnell (CMU).

Lectures

1. Lecture 1: General Information.