1. Homepage
  2. Advertising
  3. Course Plans
  4. Kuantum Hesaplamaya Giriş

PDF

COURSE DESCRIPTION AND APPLICATION INFORMATION

Course Name Code Semester T+A+L (hour/week) Type (C / O) Local Credit ECTS
Introduction to Quantum Computing CMPE 405 Fall-Spring 03+00+00 Elective 3 8
Academic Unit: Computer Engineering Department
Mode of Delivery: Face to face
Prerequisites: None
Language of Instruction: English
Level of Course Unit: Undergraduate
Course Coordinator: Özkan Karabacak
Course Lecturer(s): Özkan Karabacak
Course Objectives: This course aims at introducing quantum algorithms, which make use of laws of quantum physics, and modern digital tools for implementing quantum algorithms. Additionally, it is expected that at the end of the course the students can scrutinize the advantages and the disadvantages of modern quantum computation and communication technologies
Course Contents: Introduction to course, introduction to quantum systems, complex numbers, complex vector spaces: inner product, complex vector spaces, quantum bits, Bloch sphere, quantum gates, Deutsch-Jozsa algorithm, introduction to quantum error correcting codes, introduction to NISQ algorithms
Learning Outcomes of the Course Unit (LO):
  • 1- To be able to understand mathematical operations used for the analysis of quantum systems
  • 2- To be able to understand advantages and disadvantages of quantum computation as opposed to classical computation
  • 3- To be able to design quantum circuits and quantum codes for solving basic combinatorial problems
  • 4- To be able to use modern digital tools for implementing quantum algorithms
  • 5- To be able to understand consequences of quantum operations on cryptography
Planned Learning Activities and Teaching Methods: Lecturing, problem solving, programming.


WEEKLY SUBJECTS AND RELATED PREPARATIONS

WeekSubjectsRelated Preperation
1 Introduction to Current Quantum Computing Technology Read the introduction in Nielsen&Chuang's book
2 Superposition and measurement Read Chapter 2.2 and 2.3 in Wong's book.
3 Bloch sphere mapping Read Chapter 2.4 in Wong's book
4 One qubit quantum gates and circuits Read Chapter 2.6 and 2.7 in Wong's book
5 Linear Algebra Read Chapter 3
6 Entanglement Read Chapter 4.2 and 4.3
7 Universal Quantum Gates Read Chapter 4.4, 4.5 and 4.6
8 Quantum Error Correction Read Chapter 4.7
9 Quantum Programming Read Chapter 5
10 Bell Inequalities Read Chapter 6.1 and 6.2
11 Superdense Coding Read Chapter 6.3 and 6.4
12 Quantum Teleportation Read Chapter 6.5
13 Quantum Algorithms Read Chapter 7.3 and 7.7
14 Quantum Algorithms Read Chapter 7.8, 7.9 and 7.10


REQUIRED AND RECOMMENDED READING

Wong T.G., Introduction to Classical and Quantum Computing


OTHER COURSE RESOURCES

Michael A. Nielsen ve Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2009. Noson S. Yanofsky and Mirco A. Mannucci, Quantum Computing For Computer Scientists, Cambridge University Press, New York, 2008.
Benenti G., Casati, G. and Strini G., "Principles of Quantum Computation and Information Volume 1: Basic Concepts", World Scientific, 2008.


ASSESSMENT METHODS AND CRITERIA

Semester RequirementsNumberPercentage of Grade (%)
Homework Assignments 4 40
Midterms / Oral Exams / Quizes 3 30
Final Exam 1 30
Total: 8 100


WORKLOAD

EventsCountDuration (Hours)Total Workload (hour)
Course Hours14342
Homework Assigments41040
Midterms / Oral Exams / Quizes32060
Final Exam13030
Out-of-Class Studies where Students are Active14228
Total Workload (hour):200


THE RELATIONSHIP BETWEEN COURSE LEARNING OUTCOMES (LO) AND PROGRAM QUALIFICATIONS (PQ)

# PQ1 PQ2 PQ3 PQ4 PQ5 PQ6 PQ7 PQ8 PQ9 PQ10
LO1                    
LO2                    
LO3                    
LO4                    
LO5