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.
scheda docente
materiale didattico
Programma
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 computingTesti Adottati
Slides by the teacher.Bibliografia Di Riferimento
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 CambridgeModalità Erogazione
Lecture in class.Modalità Frequenza
Lecture in class.Modalità Valutazione
Written exam lasting about one hour.