Quantum Computers and Algorithms
General
Code: ΕΠ58
Language: Greek
Delivery: Face-to-face
Prerequisites: Knowledge of Linear Algebra, basic Theoretical Computer Science, and Programming. Familiarity with mathematical logic and computability is recommended.
Workload
- Lectures: 39.0 hours
- Lab: 0.0 hours
- Study: 56.0 hours
- Project: 30.0 hours
Course Content
Qubits, superposition, entanglement, and measurement
Quantum gates and quantum circuits
Quantum algorithms:
-Deutsch-Jozsa algorithm
-Grover’s search algorithm
-Shor’s factoring algorithm
Quantum communication protocols (e.g., quantum teleportation, BB84)
Basics of quantum computational complexity
Quantum programming with Qiskit (or equivalent framework)
Applications and limitations of quantum computation
Learning Outcomes
Upon successful completion of the course, students will be able to:
-Understand the foundations of quantum information and computation
-Design and analyze basic quantum circuits
-Explain and simulate key quantum algorithms
-Implement simple quantum algorithms using software tools and simulators
-Evaluate the capabilities and limits of quantum computing compared to classical models
Skills
-Application of quantum mechanics principles to computational models
-Abstract and mathematical problem-solving with linear algebra
-Programming quantum algorithms in Python using Qiskit or similar tools
-Use of quantum simulators and cloud-based quantum platforms (e.g., IBM Quantum)
-Scientific reasoning and critical evaluation of emerging technologies