Present the computational paradigm of Quantum Computing. At the end of the course students should be able to understand even complex Quantum algorithms and to analyze and write simpler Quantum algorithms.
teacher profile teaching materials
Programme
Quantum Computing: qubits, pairs of qubits, registers, gates with one or more qubits, no cloning theorem, Hadamard's operator, teleportation, reversible computations, Bernstein Vazirani's algorithm, Shor's algorithm. The BPP class and the BQP class. Complexity theory and Quantum Computing.Core Documentation
Slides by the teacher.Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of evaluation
The exam consists of a written test.