Academic Year 2022-2023



Federico Fogolari
Carla Piazza
Unit Credits
Teaching Period
Second Period
Course Type
Prerequisites. It is useful for the student to be already familiar with the contents of the undergraduate courses for the BS in Computer Science with particular reference to Mathematical Analysis, Physics, Foundation of Computer Science, Algorithms.
Teaching Methods. The course mainly consists of theoretical and practical classes. The e-learning webpage of the course contains all useful information for students.
Verification of Learning. The exam is written and oral. It is possible to present at the exam a relation on a topic in agreement with the teachers. In any case after the presentation, the student must answer to further questions on the course.
Knowing the basic principles of technologies based on quantum physics, the main possibilities and understanding the differences with respect to non-quantum computation models.

Schematization of quantum circuits and their use in simple algorithms, but representative of the potential applications. Ability to use the main quantum gates.

Knowing how to judge the potential and the limits of quantum computing with current technologies autonomously.

Ability to exhibit and communicate peculiarities of computing and quantum communication to a non-physicist audience in presentations or short-term papers.

Learning concepts of quantum physics and ability to relate them computer science language and tools.

See also the webpages:


1) Introduction and overview

Quantum bits

Quantum algorithms

Experimental quantum information processing

Quantum information

2) Introduction to quantum mechanics Linear algebra

The postulates of quantum mechanics Application: superdense coding

The density operator

The Schmidt decomposition and purifications

EPR and the Bell inequalities

3) Quantum circuits

Quantum algorithms

Single qubit operations

Controlled operations


Universal quantum gates

Summary of the quantum circuit model of computation

4) The quantum Fourier transform and its applications

The quantum Fourier transform

Phase estimation

Applications: order-finding and factoring General applications of the quantum Fourier transform

5) Quantum search algorithms

The quantum search algorithm

Quantum search as a quantum simulation Quantum counting

Speeding up the solution of NP-complete problems

Quantum search of an unstructured database

Optimality of the search algorithm

Black box algorithm limits

6) Quantum computers: physical realization

M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information.

Cambridge University Press. DOI 10.1017/CBO9780511976667

J. A. Bergou and M. Hillery. Introduction to the Theory of Quantum Information Processing. Springer. DOI 10.1007/978-1-4614-7092-2

Other documents provided during the course.