Quantum Information and Computing
A.Y. 2023/2024
Learning objectives
The course introduces the basics of the quantum paradigm and their application to the fields of communication, cryptography, and computation. The student will discover some of the potentialities of the quantum technologies through examples. Then she/he will consolidate her/his knowledge within a mathematical framework allowing quantum system modeling in above listed domains.
Expected learning outcomes
The student will be able to understand the premises of the quantum paradigm and the motivations for its application within different fields of computer science. She/He will acquire the ability to solve elementary problems in quantum mechanics that are of interest for the physical implementation of quantum devices for communication and computation. She/He will also learn the working principles of some paradigmatic algorithms of quantum key distribution and of some of the most important algorithms in quantum computing.
Lesson period: Second semester
Assessment methods: Esame
Assessment result: voto verbalizzato in trentesimi
Single course
This course cannot be attended as a single course. Please check our list of single courses to find the ones available for enrolment.
Course syllabus and organization
Not available in 2023/24
Lesson period
Second semester
Course syllabus
The course introduces the basics of the quantum paradigm and their application to the fields of communication, cryptography, and computing. The student will discover some of the potentialities of quantum technologies through examples. Then she/he will consolidate her/his knowledge within a mathematical framework allowing quantum system modeling in above listed domains.
First part - Quantum information and cryptography
- Peculiarities of quantum information and opportunities for communication and cryptography.
- Indeterminacy of quantum measurements and quantum random number generators.
- Quantum superposition of states and Bloch sphere: from Bit to Qbit. Dirac notation.
- Incompatible variables and Bennett and Brassard 84 protocol for key distribution.
- Composite quantum systems: separability, entanglement, and quantum non-locality.
- Ekert 91 protocol for key generation. Quantum teleportation.
- Self-interference, interaction-free measurement: Elitzur-Vaidman bomb tester.
Second Part - Quantum Computing
- A simplified computer model: the finite state automaton.
- Application of different computational paradigms to finite state automata: deterministic,
probabilistic and quantum.
- Strengths and weaknesses of the three paradigms in the world of finite state automata.
- Physical implementation of quantum finite state automata.
- More general models of quantum computing.
- The formalism of quantum gate arrays.
- An overview of the main quantum algorithms: Shor's factorization algorithm, Grover's search algorithm, the Deutsch-Josza problem.
First part - Quantum information and cryptography
- Peculiarities of quantum information and opportunities for communication and cryptography.
- Indeterminacy of quantum measurements and quantum random number generators.
- Quantum superposition of states and Bloch sphere: from Bit to Qbit. Dirac notation.
- Incompatible variables and Bennett and Brassard 84 protocol for key distribution.
- Composite quantum systems: separability, entanglement, and quantum non-locality.
- Ekert 91 protocol for key generation. Quantum teleportation.
- Self-interference, interaction-free measurement: Elitzur-Vaidman bomb tester.
Second Part - Quantum Computing
- A simplified computer model: the finite state automaton.
- Application of different computational paradigms to finite state automata: deterministic,
probabilistic and quantum.
- Strengths and weaknesses of the three paradigms in the world of finite state automata.
- Physical implementation of quantum finite state automata.
- More general models of quantum computing.
- The formalism of quantum gate arrays.
- An overview of the main quantum algorithms: Shor's factorization algorithm, Grover's search algorithm, the Deutsch-Josza problem.
Prerequisites for admission
Mathematical and algorithmic skills typically acquired after two years in IT/mathematics/physics degree courses. In particular, elementary topics of linear algebra and probability will be addressed.
Teaching methods
Lectures on theoretical foundations and classroom-based problem-solving activities.
Teaching Resources
· Slides and materials provided by the instructors.
· M.A. Nielsen, I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2010.
· E. Rieffel, W.Polak. Quantum Computing - A Gentle Introduction. The MIT Press, 2011.
· M.A. Nielsen, I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2010.
· E. Rieffel, W.Polak. Quantum Computing - A Gentle Introduction. The MIT Press, 2011.
Assessment methods and Criteria
The exam consists of a mandatory written test, two hours, which allows obtaining a grade of up to 30/30 cum laude. The test will be structured into open question on theoretical topics and exercises, with contents and difficulties similar to those faced during lectures.
INF/01 - INFORMATICS - University credits: 6
Lessons: 48 hours