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
Qubit, pairs of qubits, registries, logic functions, no cloning theorem, Hadamard operator, teleportation, reversible computations, Bernstein Vazirani algorithm, Shor algorithm, amplitude amplification and the Groover algorithm, complexity theory and quantum computingCore 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 delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour.