Learn about quantum algorithms and the principles of quantum error correction for fault-tolerant quantum computing, through full-stack overview covering both quantum hardware and software.

Quantum algorithms are notoriously hard to design, because we are accustomed to thinking “classically” about information. In this course, you will study the anatomy of quantum algorithms and learn how they can achieve a speedup over their classical counterparts. Several algorithms will be introduced and implemented, involving aspects of compilation such as qubit routing and device constraints. Since compiling algorithms to devices can lead to lengthy quantum circuits, this naturally leads to the topic of quantum error correction, a crucial aspect for a fault-tolerant quantum computer. The main principles of quantum error correction (encoding, detection, correction) will then be covered, and specific examples (Shor, Steane, Surface) will be introduced and studied. The course will conclude with an overview of the most promising quantum technologies with respect to their scalability and steps towards fault tolerance.

The course is a journey of discovery, so we encourage you to bring your own experiences, insights and thoughts via the forum!

This course is authored by experts from the QuTech research center at Delft University of Technology. In the center, scientists and engineers work together to drive research and development in quantum technology. QuTech Academy's aim is to inspire, share and disseminate knowledge about the latest developments in quantum technology.

What You'll Learn:

• Describe the compilation procedure necessary to run quantum algorithms on real quantum computers.
• Decompose integers into prime numbers with Shor’s algorithm.
• Understand how fault-tolerant quantum computation can be achieved with quantum error correction.
• Identify the most promising technologies to realize scalable quantum devices and their recent breakthroughs.