Fundamentals of Quantum Algorithms
Welcome to Fundamentals of Quantum Algorithms, the second course in the Understanding Quantum Information and Computation series comprising the following courses:
- Basics of quantum information
- Fundamentals of quantum algorithms
- General formulation of quantum information
- Foundations of quantum error correction (under construction)
This course explores computational advantages of quantum information, including what we can do with quantum computers and their advantages over classical computers. It begins with quantum query algorithms, which offer simple proof of concept demonstrations for quantum algorithms, and then moves on to quantum algorithms for problems including integer factorization and unstructured search.
This course is intended for students, professionals, and hobbyists in fields such as computer science, physics, engineering, and mathematics who are eager to gain knowledge on the theoretical foundations of quantum information and computation.
Lessons
- Introduction
- Pre-course Survey
- The query model of computation
- Deutsch's algorithm
- The Deutsch-Jozsa algorithm
- Simon's algorithm
- Introduction
- Two examples: factoring and GCDs
- Measuring computational cost
- Classical computations on quantum computers
- Introduction
- The phase estimation problem
- Phase estimation procedure
- Shor's algorithm
- Introduction
- Unstructured search
- Grover's algorithm
- Analysis
- Choosing the number of iterations
- Qiskit implementation
- Concluding remarks
- Post-Course Survey
Exam
Take this exam to test your skills. This exam is intended to be taken after reading the lessons in this course. Once you have completed the exam, come back here to see your earned badge.
Helpful materials
Learning goals
Upon completing the course, you will be able to:
- Evaluate the behavior of quantum algorithms, including Deutsch's algorithm, the Deutsch–Jozsa algorithm, Simon's algorithm, and Grover's algorithm, on specific problem instances.
- Analyze quantum circuits based on the quantum phase estimation technique.
- Implement basic query algorithms, phase estimation, and Grover's algorithm using Qiskit.
- Compare the computational costs of quantum algorithms and classical algorithms for selected problems.
Additional references
Alongside this course, you may find these resources to be helpful or interesting:
Michael Nielsen and Isaac Chuang. Quantum Computation and Quantum Information.
Phillip Kaye, Raymond Laflamme, and Michele Mosca. An Introduction to Quantum Computing.
Richard Cleve. Quantum Information Processing — Quantum Algorithms I.
Richard Cleve. Quantum Information Processing — Quantum Algorithms II.
Richard Cleve. Quantum Information Processing — Quantum Algorithms III.
Presentation slides
Copies of the slides used to create the videos for this course are available for download in pdf format.