Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
FIZ 431INTRODUCTION TO QUANTUM COMPUTATION3 + 08th Semester5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Elective
Course Objective This course aims to give an introductory answer to the question “What are the ultimate physical limits to computation and communication?”.
Course Content Introduction and Overview, Introduction to Quantum Mechanics, Introduction to Computer Science, Quantum Circuits.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1To learn the history of computer.
2To ovreview quantum mechanics.
3To learn some basics of quantum circuits.

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 00134          
LO 002 3          
LO 0032 3         
Sub Total573         
Contribution221000000000

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14342
Mid-terms12020
Final examination12626
Total Work Load

ECTS Credit of the Course






130

5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2021-2022 Spring1MUZAFFER ADAK


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
FIZ 431 INTRODUCTION TO QUANTUM COMPUTATION 3 + 0 1 Turkish 2021-2022 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Prof. Dr. MUZAFFER ADAK madak@pau.edu.tr MUH A0233 %70
Goals This course aims to give an introductory answer to the question “What are the ultimate physical limits to computation and communication?”.
Content Introduction and Overview, Introduction to Quantum Mechanics, Introduction to Computer Science, Quantum Circuits.
Topics
WeeksTopics
1 Global perspectives of course
2 Deterministic systems, Probabilistic systems, Quantum systems, Complex numbers and linear algebra, Tensor product
3 Qubits, Entanglement, Evolution of state
4 Observables and measurements, Density matrices and complex states
5 EPR paradox, Logic gates, Reversible computation
6 No-cloning theorem, No-deleting theorem
7 Teleportation protocol, Superdense coding
8 Deutsch algorithm, Deutsch-Jozsa algorithm
9 Simon algorithm
10 Grover’s search algorithm
11 Quantum Fourier transformation
12 Period finding algorithm
13 Shor algorithm
14 Errors in classical computation, Quantum errors
Materials
Materials are not specified.
Resources
ResourcesResources Language
Ahmet Çevik, Kuantum Hesaplama Kuramı, ODTÜ Yayıncılık 2021Türkçe
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam30Midterm Exam
Attendance to Lesson20Attendance to Lesson
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes