Module A: 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. Module B: Study of the quantum circuit model and its universality, in-depth analysis of the main quantum techniques for algorithm design and their analysis, introduction to some quantum programming languages and some software platforms for specifying quantum computations.
teacher profile teaching materials
Fruizione: 20830130-1 QUANTUM COMPUTING - I Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE
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.Type of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour.Fruizione: 20411002_2 IN510 – QUANTUM COMPUTING MODULO B in Matematica LM-40 R PEDICINI MARCO