Quantum-Computation-course-Basel/README.md

Quantum Computation and Error Correction

This is a course at the University of Basel, given by Dr James Wootton of Moth Quantum.

Course Content

This course is an introduction to quantum computation, with a focus in the last third on quantum error correction. It is suitable for students with a physics, nanoscience, computer science or mathematical background. Theologians and philosophers have also been known to try it out!

The language of instruction is English.

Course Text

The course will be based on the Qiskit textbook. Links to specific pages will be given for each lecture. Note that this textbook is no longer maintained, and so does not reflect the most recent version of Qiskit.

Lectures

The course consists of the following set of lectures. We will aim to do slightly more than one per week. All lectures will be given in person (14:15, Seminarzimmer 4.1), but video versions of many lectures are available also. For those, links to the pertinent parts of the Qiskit textbook can be found in the video descriptions. Let me know if any link doesn't work!

• Lecture 1: The Atoms of Computation and What is Quantum
• Lecture 3: Representing Single Qubit States and Gates
• Lecture 4: Multi qubit States and Circuit Identities
• Lecture 5: Fun with matrices
• Lecture 6: Circuits and Universality
• Lecture 7: Basic Algorithms and Protocols
• Lecture 8: From the Fourier Transform to Shor's Algorithm
• Lecture 9: Grover's Algorithm and why we can't yet run it
• Lecture 10: Introduction to QEC 1: The repetition code
• Lecture 11: Introduction to QEC 2: The surface code
• Lecture 12: Introduction to QEC 3: LDPC codes
• Lecture 13: Decoding 1: Running Circuits and Interpreting Outputs
• Lecture 14: Decoding 2: Correcting Errors
• Lecture 15: Decoding 3: Programming and Using a Matching Decoder
• Lecture 16: Decoding 4: Programming HDRG Decoders

Extra Topics

For some lectures there is also some extra content. We'll cover it if there is time. Otherwise, you can expect to see it in the exercises.

• Lecture 1: The Unique Properties of Qubits
• Lecture 2: Python, Qiskit and Hello Qiskit
• Lecture 3: Density matrices, partial trace and Schmidt decomposition.
• Lecture 5: Proof that Clifford + t is universal
• Lecture 6: Relative Entropy and Entanglement Sharing
• Lecture 7: Quantum key distribution
• Lecture 9: Quantum noise and Stabilizer formalism

Exercises

Take-Home Exercises

Four sets of take-home exercises set throughout the course. There will be hints sessions at 16:15 on the dates that these are set. Solutions will be presented after the exercises have been graded.

Note: These exercises form 50% of your final grade

Final Project

As in previous years, we'll have a final project instead of a standard exam. The main aim of this is for you to demonstrate understanding of the topics in the course. The format is fairly free to allow you to do this in a way that suits you best. Collaboration will be fine. But everyone needs something unique to submit.

Note: This project forms 50% of your final grade

Important dates

You have until tbd January to hand-in your final projects (to me, by email). You are expected to put a similar amount of time and effort in to the final project as you would put into two sets of exercises.

You have until tbd December to email me and ask for feedback on project ideas, and to give guidelines for what would be expected for them.

Project ideas

Below are examples of the different kinds of project you can choose from. Examples of existing work are given to give you and idea of what you can produce. A list of specific projects that you can do (for those of you that don't want to come up with your own) can be found at the end.

Write an explanation of a topic of your choice

You can write about one of the topics covered in the lectures, or about something that wasn't covered. You can include relevant example code in Qiskit, or you can avoid the programming and just have text and images

Examples

• Qiskit Textbook section on Phase Kickback.
• Qiskit Textbook section on Berstein-Vazirani.
• An attempt at a popular science article on quantum non-locality.

Make a game using quantum programming

Throughout the history of computing, people have been making simple games to help understand the new technology. Now we can do the same thing with quantum computing. I wrote a whole article on this idea, which you can find here.

Basically, reasons why we might make a quantum game are:

• To provide a simple and accessible example of a quantum program in action.
• To educate people about quantum computing.
• To start looking for ways in which quantum computing might actually be useful for games.

Remember: don't just use quantum for a random number generator!

Examples

• Hello Qiskit: a game that teaches quantum computing.
• Quantum Awesomeness: a game that gives insight into real devices (and featured in the NZZ).
• QPong: A game that implements the core game mechanic with a (simulation of).
• Q Avrai: using quantum computing for map generation.

Run benchmarks on prototype devices

You can access real quantum hardware at IBM Quantum, Quantum Inspire and other places. But how well do they actually work? Many people have run various different types of quantum circuit and analyzed the results to give some insight into this.

You can come up with your own method for benchmarking, or reproduce something that has already been done on a different device. The easiest way is to implement repetition codes using Qiskit-QEC. But since this package (hopefully) makes it easy, you'll need to try out more than just a single code on a single device

Examples

• Quantum Awesomeness: a game that gives insight into real devices (and featured in the NZZ).
• Decoherence of entangled states: A paper looking at decoherence in GHZ states.
• Repetition Codes: This uses Qiskit's old topological_codes module, now available in Qiskit QEC.

Specific project ideas

• Write a decoder for the qudit or non-Abelian decoding problems shown in Decoding 4: Programming HDRG Decoders.
  • Explain your method
  • Provide your code
  • Provide threshold graphs for different values of k
• A recent scheme for benchmarking known as the layer fidelity has some similarities to my old game-based benchmark, Quantum Awesomeness.
  • Explain the two approaches and discuss their similarties and differences.
  • Propose a new 'Quantum Awesomeness', that uses some ideas from the layer fidelity.
  • Produce and explain some of the basic circuits required for your idea.