B3567 - INTRODUCTION TO QUANTUM COMPUTING

Learning outcomes

At the end of the course the student is acquainted with the basic mathematical notions underlying quantum computing seen as an alternative computing paradigm, and knows how to implement quantum algorithms as families of quantum circuits. Moreover, he has an understanding of more advanced topics like quantum cryptography, quantum error correction, and the development of graphical languages for quantum circuits.

Course contents

First module:

- overview on quantum computing

- mathematical background: linear algebra and complex Hilbert spaces

- qubits and their mathematical representation

- a quantum computational model: quantum circuits

- sample circuits (Deutsch, Bernstein-Vazirani)

Second module:

- quantum computational complexity

- quantum algorithms (Simon, Grover, Shor)

- quantum error correction

- quantum protocols

- overview on quantum programming and quantum graphical languages

Readings/Bibliography

[1] P. Kaye, R. Laflamme, M. Mosca. An introduction to quantum computing. Oxford University Press, 2007.
[2] M. Hirvensalo. Quantum computing. Springer, 2004.

Teaching methods

The course includes theoretical lessons and exercises. Programming exercises will be done by students on their own computers, alone or in small groups.

Assessment methods

The exam consists in a seminar: during the course a list of in-depth study research papers will be made available, and each student will choose and present one of these papers. During the seminar there will be questions on the selected paper and on its relations with topics studied during the course. Upon agreement with professors, papers outside the selected list can be chosen, or the seminar may be replaced by project work.

Teaching tools

Teaching material will be provided via the Virtuale website.

Office hours

See the website of Ivan Lanese

See the website of Ugo Dal Lago