Introduction to quantum computation
These lectures will introduce the basic formalism of quantum computing, assuming no significant prior acquaintance with the subject. We will aim to cover the following topics:
Why quantum computing?
Physical states in quantum mechanics, qubits, composite systems, entanglement.
Quantum measurements (Born rule). Unitary gates and quantum circuits.
Quantum non-locality. Teleportation.
Some simple quantum algorithms, the DJ algorithm.
The quantum Fourier transform mod N and its efficient implementation.
Quantum computing and NP? Grover's quantum searching algorithm.
Selected topics in the classical simulation of quantum algorithms (if time permits) e.g. tensor network contractions, Pauli and Clifford operations etc.
Slides
Lecture 1
Lecture 2
Lecture 3
Lecture 4
References:
1. My lecture notes (for a longer course) available at
http://www.cs.bris.ac.uk/Teaching/Resources/COMSM0214/ give a leisurely account of much of the above.
Other useful references include:
2. John Preskill's notes for Caltech course on quantum
computation, available at
http://theory.caltech.edu/people/preskill/ph229/
3. S. Loepp and W. Wootters ”Protecting information: from classical error correction to quantum cryptography” (chas 2, 7). CUP 2006.
4. M. Nielsen and I. Chuang "Quantum computation and information". (Chas 1-6).CUP (a standard, although somewhat encyclopaedic, reference).
