In the previous modules of this course, we have traversed the lower layers of the quantum stack, seeing how the instructions that make up a quantum algorithm can not only be stored on classical computers, but also manipulated by classical algorithms, in order to account for the individual characteristics of different quantum devices. Now we are prepared to ascend to the higher, more abstract layers of the stack, which are concerned with quantum circuits, quantum algorithms, and the quantum error-correction techniques that are required to make them resist the noise that affects quantum hardware.

This module begins with a discussion of quantum circuits and algorithms led by Ben Criger. Over the course of four densely-packed lectures and one quiz, Ben will touch on topics including the equivalences between small gates and circuits, phase kick-back, and the two ‘textbook’ quantum algorithms which use it: quantum phase estimation (which is also the prime area of application for the quantum Fourier transform) and Grover’s algorithm. Over the next two lectures and one quiz, Professor Barbara Terhal will introduce quantum error correction, a vital technique for using noisy qubits and imprecise control to carry out quantum algorithms in an arbitrarily precise manner.

We hope that you enjoy this deep dive into a cutting-edge field of theoretical research.