Quantum Computing: Lecture Notes

07/19/2019
by   Ronald de Wolf, et al.
0

This is a set of lecture notes suitable for a Master's course on quantum computation and information from the perspective of theoretical computer science. The first version was written in 2011, with many extensions and improvements in subsequent years. The first 10 chapters cover the circuit model and the main quantum algorithms (Deutsch-Jozsa, Simon, Shor, Hidden Subgroup Problem, Grover, quantum walks, Hamiltonian simulation and HHL). They are followed by 2 chapters about complexity, 4 chapters about distributed ("Alice and Bob") settings, and a final chapter about quantum error correction. Appendices A and B give a brief introduction to the required linear algebra and some other mathematical and computer science background. All chapters come with exercises, with some hints provided in Appendix C.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2023

Basic ZX-calculus for students and professionals

These are the lecture notes of guest lectures for Artur Ekert's course I...
research
05/18/2019

Brief Notes and History Computing in Mexico during 50 years

The history of computing in Mexico can not be thought without the name o...
research
12/29/2022

Lecture Notes on Quantum Algorithms

The lecture notes contain three parts. The first part is Grover's Search...
research
01/20/2022

Lecture Notes on Quantum Algorithms for Scientific Computation

This is a set of lecture notes used in a graduate topic class in applied...
research
03/04/2020

Notes on Randomized Algorithms

Lecture notes for the Yale Computer Science course CPSC 469/569 Randomiz...
research
08/04/2022

Descriptive combinatorics and distributed algorithms

This is a draft of an article to appear in the October 2022 issue of the...
research
02/09/2022

QAC: Quantum-computing Aided Composition

In this chapter I will discuss the role of quantum computing in computer...

Please sign up or login with your details

Forgot password? Click here to reset