Learning Outcomes

On successful completion of the course students should be able

• To master the quantum computational model.
• To design and analyse basic quantum algorithms.
• To inderstand and mplement basic techniques in quantum data science.

Syllabus

• Quantum computation and algorithms
  • The quantum computational model (gates, measurements, and circuits).
  • Introduction to quantum algorithms. Algoritmic classes and complexity.
  • Quantum algorithms based on phase amplification: Goriver's algorithm and its generalizations.
• Quantum techniques for data science
  • ...

Summaries (2025-25)

T Lectures

Sep 22 (09:00 - 11:00)	Introduction to Quantum Computation and the course dynamics (slides).
Sep 29 (09:00 - 11:00)	What's in a qubit? Representation and evolution of a quantum system. Single-qubit gates and the Bloch sphere (slides).
Oct 6 (09:00 - 11:00)	Introduction to quantum algorithms. A first worked example: The Deutsch algoritm. A quantum solution to the Bernstein-Vazirani problem (slides).
Oct 13 (09:00 - 11:00)	Unstructured search problems and the Grover's algorithm (slides).
Oct 20 (09:00 - 11:00)	Quantum fundamentals with pennylane: Superposition, entanglement and interference. (notebook from class).
Oct 27 (09:00 - 11:00)	Qubits collectively: Composition and entanglement. Quantum teleportation. (slides).

TP Lectures

Sep 25 (16:00 - 18:00)	Superposition and quantum interference. Review of the mathematical background for quantum computation (slides).
Oct 2 (16:00 - 18:00)	(to be re-scheduled)
Oct 9 (16:00 - 18:00)	Exercises (1) (pdf)
Oct 16 (16:00 - 18:00)	Quantum computing introduction with pennylane (slides) (notebook from class).
Oct 23 (16:00 - 18:00)	Implemeting Deutsch algorithm with pennylane (notebook)
Oct 29 (16:00 - 18:00)	Exercises (2) (pdf)

Bibliography

Quantum Computation and Algorithms

• M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information (10th Anniversary Edition). Cambridge University Press, 2010
• E. Rieffel and W. Polak. Quantum Computing: A Gentle Introduction. MIT Press, 2011.
• N. S. Yanofsky and M. A. Mannucci. Quantum Computing for Computer Scientists. Cambridge University Press, 2008.

Quantum Computation for Data Science

• ...

Complementary readings

• S. Aaronson. Quantum Computing since Democritus. Cambridge University Press, 2013.
• J. Preskill Quantum Computing in the NISQ era and beyond. Quantum 2, 79, 2018.

Links

• Quantum Programming in PennyLane
• Quantum and Linear Optical Computation Group at INL
• HASLab - High Assurance Software Lab at INESCT TEC

Pragmatics

Lecturers

• Luís Paulo Santos
• Luís Soares Barbosa
• André Sequeira

Assessment

• Individual assignment, with written report and individual, oral defense (50%)

  Oral: 5-7 January 2026

• Individual test (50%)

  Test: 11 December 2025

Contact

• Appointments (please send an email the day before)

  - Luis: Wed, 18:00-20:00 and Fri, 18:00-20:00; Luis Paulo: ...; André: send email to arrange.

• Email: psantos at di dot uminho dot pt (Luis Paulo), lsb at di dot uminho dot pt (Luis) and andre.m.sequeira at inesctec dot pt (André)
• Last update: 2025.10.24