/QML-Course

I developped a course on quantum machine learning for École de Technologie Supérieure (Montréal, QC, CA).

Primary LanguageHTMLMIT LicenseMIT

QML-Course

I developed a course on quantum machine learning for École de Technologie Supérieure (Montréal, QC, CA) with support from Catalina Albornoz Anzola. She is the Quantum Community Manager at Xanadu.

The course is given to students at the end of their bachelor's degree or the beginning of their Master's degree. Prerequisites in linear algebra and introduction to quantum computing or quantum information are needed. The course gave an overview of the field in 2024 and the prerequisites for students interested in developing QML algorithms or applying them to real-world scenarios.

The course is in French, so the slides are in French but can be translated. PennyLane is the primary library during the course.

Notebooks are provided in html format. They build on demos from PennyLane

Winter session January to May 2024.

Resources

Three books are used as primary resources for this first edition of the course (pre-alpha 2024).

Additional resource: The Codebook by Xanadu. The introduction is available in French.

Research papers and YouTube videos used for the courses are cited where needed and placed in the References slides at the end of each lecture.

Content

Not all lectures are yet available. Lecture 7 will be given on February 22nd and uploaded. Each lecture will be uploaded each week.

Extra Material:

Complementary Material:

Exam Modalities

  • Mid-session exam: Scientific vulgarization presentation 10 minutes per student
  • Homework: QML Research paper reproduction (team - 2 persons)
  • Final exam: Presentation of the homework like a conference, 20 minutes for the team

Mid-session subjects

Non-exhaustive list, students can choose their own

  • Tensor Networks
  • Input problem
  • Hamiltonian and QML
  • Dequantization
  • How can QML be used to simulate new materials?
  • Quantum Advantage
  • Quantum Image Generation

Final exam papers

Non-exhaustive list, students can choose their own