CSC 475 Quantum Computing

The course deals with a new field of computer computation called: quantum computation. This computation is based on quantum mechanical principles. In the 1980's the physicist Richard Feynman noticed that quantum physics cannot be efficiently simulated on classical computers. This was taken as an indication that computers which exploit quantum physics could be substantially more powerful than computers build on the basis of classical physics. The essential reason for this potential efficiency is the fact that quantum systems can use superposition, entanglement, and nonlocality as a way to compute quasi in parallel. Since the development of real-world quantum computers requires enormous resources, theoretical computer science finds itself in the responsible situation to explore the possible benefits and limitations of such systems beforehand. Upon successful completion of the course, students -will be able to understand what Quantum computing and quantum circuits are about, why they matter, and what the scientific prospects concerning are. -will be familiar with the structural understanding of some basic computer science complexities and why quantum algorithms and Quantum protocol concepts, such as Deutsch oracle, Shore, Grover algorithms, Quantum Fourier transform, and some important protocols such as quantum teleportation can deal with complexities. -and also become familiar with such important nano devices like QCA (Quantum Cellular Automata, so called: Transistor without current).

Credits

3

Cross Listed Courses

CSC 475 & CSC 575

Prerequisite

CSC 326 or EE 326