Pamukkale University
University is the guide to life
Welcome to PAU;
Prospective Student
Our Students
Our Staff
TR
Information Package & Course Catalogue
Home Page
About University
Name And Address
Acedemic Authorities
General Discription
Academic Calendar
General Admission Requirements
Recognition of Prior Learning
General Registration Procedures
ECTS Credit Allocation
Academic Guidance
Information For Students
Cost Of Living
Accommodation
Meals
Medical Facilities
Facilities for Special Needs Students
Insurance
Financial Support for Students
Student Affairs
Learning Facilities
International Programs
Language Courses
Internships
Sports Facilities and Leisure Activities
Student Associations
Practical Information for Mobile Students
Degree Programmes
FIRST CYCLE - BACHELOR'S DEGREE
FACULTY OF ENGINEERING
COMPUTER ENGINEERING DEPARTMENT
253 Computer Engineering
Course Information
Course Learning Outcomes
Course's Contribution To Program
ECTS Workload
Course Details
Print
COURSE INFORMATION
Course Code
Course Title
L+P Hour
Semester
ECTS
CENG 465
QUANTUM COMPUTATION
3 + 0
8th Semester
5
COURSE DESCRIPTION
Course Level
Bachelor's Degree
Course Type
Elective
Course Objective
. To learn the mathematical fundamentals of quantum computation in terms of complex vector algebra. 2. To gain the ability constructing the components of quantum algorithms, to devise quantum algorithms. 3. To understand the supremacy of the quantum algorithms over the classical counterparts 4. To learn the quantum communication channels their applications for quantum information. 5. To gain the ability coding the algorithms numerically and calculating the fidelity of the algorithms as well as the quantum channels. 6. To gain information about the physical realization of quantum computers.
Course Content
Essential Linear Algebra . Complex matrix algebra . State vector . Density matrix . Quantum operators . Postulates of quantum mechanics . Quantum computational complexity . Quantum algorithm components . Deutsch-Jozsa algorithm . Quantum Fourier Transform algorithm . Quantum search (Grover) algorithm . Quantum order finding algorithm . Quantum teleportation . Quantum dense coding . Quantum error correction . Quantum secure communication . Quantum key distribution . Physical realization of quantum computers
Prerequisites
No the prerequisite of lesson.
Corequisite
No the corequisite of lesson.
Mode of Delivery
Face to Face
COURSE LEARNING OUTCOMES
1
Learning the mathematical foundations of quantum computing
2
Have the ability to create quantum algorithms
3
Ability to code and implement quantum algorithms or quantum channels
COURSE'S CONTRIBUTION TO PROGRAM
PO 01
PO 02
PO 03
PO 04
PO 05
PO 06
PO 07
PO 08
PO 09
PO 10
PO 11
PO 12
LO 001
LO 002
LO 003
Sub Total
Contribution
0
0
0
0
0
0
0
0
0
0
0
0
ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
Activities
Quantity
Duration (Hour)
Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)
14
3
42
Hours for off-the-classroom study (Pre-study, practice)
10
5
50
Mid-terms
1
13
13
Final examination
1
25
25
Total Work Load
ECTS Credit of the Course
130
5
COURSE DETAILS
Select Year
All Years
This course is not available in selected semester.
Print
L+P:
Lecture and Practice
PQ:
Program Learning Outcomes
LO:
Course Learning Outcomes
{1}
##LOC[OK]##
{1}
##LOC[OK]##
##LOC[Cancel]##
{1}
##LOC[OK]##
##LOC[Cancel]##
Home Page
About University
Name And Address
Acedemic Authorities
General Discription
Academic Calendar
General Admission Requirements
Recognition of Prior Learning
General Registration Procedures
ECTS Credit Allocation
Academic Guidance
Information For Students
Cost Of Living
Accommodation
Meals
Medical Facilities
Facilities for Special Needs Students
Insurance
Financial Support for Students
Student Affairs
Learning Facilities
International Programs
Language Courses
Internships
Sports Facilities and Leisure Activities
Student Associations
Practical Information for Mobile Students
Degree Programmes