Mathematics of Quantum Computing
MATH 265
Spring 2026
| Section:
01
|
This is a one-semester course introducing students to the mathematics of quantum computing. No prior understanding of quantum mechanics will be assumed. However, the course will rely heavily on material from linear algebra, and will also assume students are familiar with basic concepts from group theory. Classical computers store information in the form of bits -- a binary state of zero or one. In a quantum computer, information is processed in the form of qubits, which can exist not just in these two classical states, but in combinations of these two states -- this is the notion of superposition. In this course, we study how to model the fundamental notions of quantum computing with mathematics, and explore the ways quantum computing may supersede classical computing for certain tasks. The precise topics covered will depend in part on the backgrounds and interests of enrolled students, but primary topics for the course include Bell's inequality, Shor's algorithm, and Grover's search algorithm. Other aspects of quantum computing will be explored as time permits. |
|
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: MATH261 AND (MATH221 OR MATH22) |
|
Fulfills a Requirement for: (Mathematics) |
|
Past Enrollment Probability: Not Available |
|
|
|