CSE493Q: Introduction to Quantum Computing
Description: The goal of the course is to rigorously understand the basics of the theory of quantum computation and to explore and understand as many fascinating applications/phenomena in quantum information as possible. Approximate outline: - Review of basic linear algebra. - Qubits, gates and measurements. - Interference - an application: Elitzur-Vaidman tester. - The uncertainty principle - an application: Quantum key distribution. - Entanglement and multi-qubit states and gates - an application: Bell's theorem and non-local games. - Quantum algorithms I: Deutsch's and Simon’s algorithm - Quantum algorithms II: Grover's algorithm. - Quantum programming (TBD) - Informal overview of other quantum algorithms: Shor's algorithm and Hamiltonian Simulation. Prerequisites: students should have taken at least one linear algebra (MATH 208) and one probability class (e.g. CSE 312) (more of these are helpful, but I will review what's strictly necessary at the start), and preferably also one discrete math class (CSE 311).
Prerequisites: CSE 312, MATH 208Credits: 4.0
Portions of the CSE493Q web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly creditied. The CSE493Q Web: © 1993-2024, Department of Computer Science and Engineering, Univerity of Washington. Administrative information on CSE493Q (authentication required).