Learning Home Catalog Composer
Home Catalog Composer

Fundamentals of quantum algorithms
A portrait of John Watrous
Created by
Includes video content

This is the second unit of the Understanding quantum information and computation series, which explains quantum information and computation at a detailed mathematical level.

This unit, "Fundamentals of quantum algorithms," explores computational advantages of quantum information, including what we can do with quantum computers and their advantages over classical computers. The unit 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.

Sign in to track progress Start from beginning
Fundamentals of quantum algorithms illustration


Expand all lessons
Quantum query algorithms
  • Introduction
  • Pre-course Survey
  • The query model of computation
  • Deutsch's algorithm
  • The Deutsch-Jozsa algorithm
  • Simon's algorithm
Go to lesson
Quantum algorithmic foundations
  • Introduction
  • Two examples: factoring and GCDs
  • Measuring computational cost
  • Classical computations on quantum computers
Go to lesson
Phase-estimation and factoring
  • Introduction
  • Phase estimation problem
  • Phase estimation procedure
  • Shor's algorithm
Go to lesson
Grover's algorithm
  • Introduction
  • Unstructured search
  • Grover's algorithm
  • Analysis
  • Choosing the number of iterations
  • Qiskit implementation
  • Concluding remarks
  • Post-Course Survey
Go to lesson

Helpful materials

Additional references

Alongside this course, you may find these resources to be helpful or interesting:

Presentation slides

Copies of the slides used to create the videos for this course are available for download in pdf format.