CS 682: Quantum Computing

Announcements

- The link for first course handout is here .
- The link for extra readings is here .
- The online endsem is scheduled on 10/05/21 from 4-7 PM.

Course Notes

Topic |
Link |

Introduction to quantum computing | Introduction |

State space and vector spaces | First and fourth postulate |

Operations on a quantum system | Second Postulate |

Measurements in quantum computing | Third Postulate |

Deutsch's algorithm, classical and quantum circuits | Circuits |

Quantum teleportation and Deutsch-Jozsa algorithm | Applications |

Randomized and approximation model, Bernstein-Vazirani algorithm | Randomized algorithms |

Fourier transform and phase estimation | Basic algorithms |

Simon's algorithm and Hidden subgroup problem | Hidden subgroup |

Factorization and order finding | Factor |

Guest Talk: Anand Kumar Jha, IIT Kanpur | Experiments with entangled photons |

Video for Young's double slit experiment | Video |

Grover search, amplitude amplification | Search |

Optimality of Grover search, query complexity | Query |

Error Correction, Cryptography | Transmit |

Extra readings | Readings |

### Administrative details:

- Time: 3:30-4:50 TF; discussion hour (From 15th Jan): 4:00-5:00 Friday.
- Anti-cheating policy: from CSE Dept
- Drop policy: from DUGC

### Course description:

Quantum computation captured the imagination of computer scientists with the discovery of efficient quantum algorithms for factoring and fast algorithm for search. The aim of
quantum computing is to do computation using the quantum mechanical effects. The study of quantum computation and information involves mathematics, physics and computer science.
This course will primarily focus on the mathematics and computer science aspect of it. We will start the course by answering "why quantum computing?" and then move on to study the basics of
linear algebra and computer science needed to understand the theory of quantum computation. Then, we will talk about quantum circuit model in which most of the quantum algorithms are designed.
The final part of the course will look at quantum algorithms and the advantage they offer over classical counterparts.
The only prerequisite for the course is the basic understanding of linear algebra. There are lot of other interesting topics in quantum computing which will not be covered in this course.
In particular, we will miss topics like physical realization of quantum computers and quantum information theory. Students are encouraged to take them as part of
the project in the course.

References

### Quantum computing

- Quantum Computation and Quantum Information, M A Nielsen and I L Chuang.
- An Introduction to Quantum Computing, P Kaye, R Laflamme and M Mosca.

### Linear Algebra

- Linear Algebra and its Applications, G. Strang.
- Matrix Analysis, Bhatia.

### Quantum courses