Present advanced Quantum Computing paradigms and algorithms, as well as the main applications to PKI
Curriculum
teacher profile teaching materials
Programme
Qubits, qubit pairs, registers, logic gates with one or more qubits, no cloning theorem, the Hadamard operator, teleportation, reversible computations, the Bernstein Vazirani algorithm, the Shor algorithm, amplitude amplification and the Groover algorithm, complexity theory and quantum computing, measurements and observables, the Bloch sphere, quantum circuit simulators.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 delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Programme
Qubits, qubit pairs, registers, logic gates with one or more qubits, no cloning theorem, the Hadamard operator, teleportation, reversible computations, the Bernstein Vazirani algorithm, the Shor algorithm, amplitude amplification and the Groover algorithm, complexity theory and quantum computing, measurements and observables, the Bloch sphere, quantum circuit simulators.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 delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Mutuazione: 20830130-1 QUANTUM COMPUTING - I Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE
Programme
Qubits, qubit pairs, registers, logic gates with one or more qubits, no cloning theorem, the Hadamard operator, teleportation, reversible computations, the Bernstein Vazirani algorithm, the Shor algorithm, amplitude amplification and the Groover algorithm, complexity theory and quantum computing, measurements and observables, the Bloch sphere, quantum circuit simulators.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 delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Programme
Qubits, qubit pairs, registers, logic gates with one or more qubits, no cloning theorem, the Hadamard operator, teleportation, reversible computations, the Bernstein Vazirani algorithm, the Shor algorithm, amplitude amplification and the Groover algorithm, complexity theory and quantum computing, measurements and observables, the Bloch sphere, quantum circuit simulators.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 delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Mutuazione: 20830130-1 QUANTUM COMPUTING - I Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE
Programme
Qubits, qubit pairs, registers, logic gates with one or more qubits, no cloning theorem, the Hadamard operator, teleportation, reversible computations, the Bernstein Vazirani algorithm, the Shor algorithm, amplitude amplification and the Groover algorithm, complexity theory and quantum computing, measurements and observables, the Bloch sphere, quantum circuit simulators.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 delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour.