CPSC 091T. Special Topics: Quantum Computing

Quantum computing is a radically different model of computation in which quantum phenomena like entanglement can be exploited to solve certain computational problems much more efficiently. This speedup has now been experimentally demonstrated in specialized contexts by real-world quantum computers, and recent, massive corporate and governmental investments increase the likelihood that larger and more generalized quantum computers are on the horizon. In this course, we will study this model from a largely theoretical perspective, asking what could be achieved by hypothetical general-purpose quantum computers. For context, we will also investigate several aspects of the “classical” (non-quantum) theory of computation, comparing quantum and classical notions of circuits, error correction, tractability, and cryptography. We will explore quantum algorithms for tasks like factoring, and we will practice programming simulated quantum computers
This is a Group 1 course.
Prerequisite: CPSC 035 required. Mathematics background at the level of Linear Algebra or higher is required (may be taken concurrently).
Natural science.
1.0 credit.
Fall 2024. Lutz.
Catalog chapter: Computer Science
Department website: https://www.swarthmore.edu/computer-science

Access the class schedule to search for sections.