Course Program:
The field of quantum computation is based on the usage of the non-classical features of quantum systems to obtain efficient solutions for difficult computational problems. There have been some significant advances in this regard, Shor's polynomial time factorization algorithm (with its important implications for cryptography) being the most notable one. This course is aimed at computer scientists and engineers who need not have had a deep education about quantum physics. We will be focusing on the "software" of quantum computation, and any prerequisite material (mostly, a warmup of linear algebra) will be covered as we go along.
Topics:
1. Introduction to linear algebra
2. Quantum bits
3. Special matrices
4. Deutsch's algorithm
5. The Deutsch-Jozsa algorithm
6. Simon's algorithm
7. Grover's algorithm
8. Random walks
9. Quantum complexity theory
Textbook:
Reference Books:
"Computational Complexity: A Modern Approach" by S. Arora and B. Barak, Cambridge University Press, 2009
Notes:
First and second midterm grades, followed by final "exam" grades and number of submitted homeworks:
| AKGÜL |
|
40 | 70 | 60 | 2 | ||||||||
| BOZKURT | 75 | 69 | 100 | 5 | |||||||||
| KURUTMAZ | 
|
83 | 90 | 90 | 6 | ||||||||
| ÖZTÜRK |
|
60 | 24 | 100 | 3 | ||||||||
| PARLAK | 
|
48 | 72 | 50 | 7 | ||||||||
| SURAT | 56 | 43 | 90 | 1 | |||||||||
| TAŞKAYA |
|
66 | 54 | 95 | 3 | ||||||||
| TÜRKMEN |
|
70 | 66 | 94 | 5 | ||||||||
| YİĞİT |
|
54 | 52 | 95 | 0 | ||||||||
