From classical to quantum information
Academic year: 2024/25
Semester: 1
CFU: 6
Hours: 45
Teachers
Syllabus
Classical computation and communication (2 CFU)
- Classical Computation Theory
- Turing Machines
- Decisable and undecidable problems
- Elements of Complexity Theory
- Computational complexity classes P and NP, polynomial-time reductions K-Nearest Neighbors
- Reference to cybersecurity
- Logic Gates
- Boolean algebra
- Fundamental logic gates
- Quantum circuits
- Physical implementation of a logic gate
- Classical Hardware
- Transistor and bits
- Uniform families of circuits
- Parallel computation
- Classical information theory
- Shannon entropy
- Communication channels and channel capacity
- Shannon’s source coding theorem
- Shannon’s channel capacity theorem
Quantum computers, protocols and hardware (4 CFU)