PHYS/EEE 532
Quantum Communications and Information
Processing
Spring 2001-2002 |

Prof. Erdal Arikan, Elect. Eng. Dept., Ext 1347, arikan@ee.bilkent.edu.tr

- Quantum Computation
- Quantum Algorithms
- Deutsch's problem
- Simon's algorithm
- Shor's factoring algorithm
- Grover's search algorithm
- Quantum Fourier transform
- Quantum phase estimation
- Quantum Circuits and Complexity
- Reversible computation
- Universal quantum gates
- Classical and quantum complexity classes
- Quantum Information Theory
- Classical notions of information
- Shannon entropy
- Source coding
- Noisy channel coding
- Quantum information
- Von Neuman entropy
- Generalized measurements
- Accessible information, Holevo bound
- Quantum channel capacity
- Quantum error correction
- Miscellenous other subjects (time permitting)
- Entanglement assisted communication
- Quantum cryptography

Quantum Computation and Quantum Information, Michael A. Nielsen and Isaac L. Chuang. Cambridge University Press 2000, ISBN 0-521-63503-9. Available in the Bookstore. The book has a web page: http://squint.org/qci/

Quantum Information and Computation, John Preskill. On reserve at the Library. It is recoomended that you obtain a copy of this set of notes. They may be downloaded from John Preskill's Quantum Computation Course webpage.Los Alamos e-print archives Los Alamos Archives is where you may find the original papers as well as recent research contributions.

Overview of Quantum Computation

Computational Complexity

Reversible Computation and Quantum Circuits

Quantum Circuits, Universality

Quantum Circuits, cont'd

Simon's Algorithm

Quantum Fourier Transform

Quantum Period Finding Algorithm

Shor's Factoring Algorithm

Grover's Search Algorithm

Quantum Measurements; Super-Dense Coding

Density Operator; Teleportation

Schmidt Decomposition, Purification

Shannon Entropy and Source Coding

Classical Channel Capacity

Von Neumann Entropy

Schumacher Compression

Holevo's Bound

- Set
1

Set 2

Set 3

Set 4

Set 5

Set 6

Set 7

Set 8

Set 9

Set 10

Set 11

Set 12

Set 13

Set 14

Set 15

Set 16

Guidelines

Schedule of Presentations

Problem set 1. Due: 22 Feb 02

Problem set 2. Due: 8 March 02

Problem Set 3. Due: 5 April 02

Problem Set 4. Due: 19 April 02

Problem Set 5. Due: 30 April 02

PHYS/EEE 531 or consent of the instructor (E. Arikan).Since this is a subject of interest to physicists, mathematicians, computer scientists, and engineers, we do not assume a uniform background on the part of all students. The required background will be taught as needed in the course. However, we assume a solid understanding of axiomatic structure of quantum physics, linear algebra, and elementary probability. Students with no background in quantum physics may still take the course provided they are willing to spend extra time to learn the material. If you are unsure whether you have the required background for the course, please consult the instructor.

Grading will be based on homework assignments 50% and a term paper 50%. For the term paper, each student will select a topic in coordination with the instructor and write a term paper on that topic. A complete literature survey of the selected topic is expected. Term papers will be in the form of a survey paper, explaining the problem studied, all the major results, and a discussion. Each student will give a 20 minute oral presentation at the end of the course during the final exam week.

- John Preskill's Quantum Computation Course, Caltech
- Los Alamos Archives
- Centre for Quantum Computation at Oxford University
- Stanford-Berkeley-MIT-IBM NMR Quantum Computation Project
- Quantum Computation at Los Alamos
- Umesh Vazirani's Quantum Computation Course at Berkeley

- Watch this space for course announcements.

Erdal Arikan arikan@ee.bilkent.edu.tr

Alexander Shumovsky shumo@fen.bilkent.edu.tr