Skip to main content
CPE
414
Quantum Computing
The course will offer a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with a novel introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications: Shor's factoring algorithm, Grover's search algorithm, and quantum error correction.
Prerequisites:
0612300
0612414
(3-0-3)

Credits and Contact Hours

3 credits, 43 hours

Course Instructor Name

Prof. Maytham Safar and Dr. Ameer Mohammed

Textbook

  • Quantum Computer Science: An Introduction, University Press, N. David Mermin, 2007
  • Reference Texts
  • Quantum Computing for Computer Scientists by Noson S. Yanofsky and Mirco A. Mannucci, Illustrated Edition, Cambridge University Press, 2008. ISBN: 978-0521879965
  • Qiskit Pocket Guide: Quantum Development with Qiskit by James Weaver and Frances Harkins, 1st Edition, O'Reilly Media, 2022. ISBN: 978-1098112479

Catalog Description

The course will offer a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics.

It begins with a novel introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications: Shor's factoring algorithm, Grover's search algorithm, and quantum error correction.

Prerequisite

CpE-300

Specific Goals for the Course

Upon successful completion of this course, students will be able to:

  • Apply basics of quantum computing for solving engineering problems. (Student outcomes: 1, 2)
  • Use bit representation for quantum machines. (Student outcomes: 1)
  • Represent register content and initialization for the machine's input and output. (Student outcomes: 1, 2)
  • Design and write algorithms for quantum machines. (Student outcomes: 1, 2)

Topics to Be Covered

  • Quantum Computing Fundamentals
  • The Quantum Computational Process
  • Deutsch's Problem: Functions as oracles
  • The Bernstein-Vazirani Algorithm
  • Simon's Problem: The Hidden Subgroup Problem
  • Grover's Search Algorithm
  • Period Finding and Shor's Algorithm
  • Quantum Error Correction
  • Quantum Cryptography