Quantum Computation

Ashley Montanaro

Quantum computers are machines that are designed to use the principles of quantum mechanics to do things that cannot be done by any standard computer based only on classical physics. This unit will introduce the emerging theory of quantum computation, which has many remarkable features compared with classical computation. The unit will cover some of the most important quantum algorithms currently known, which outperform classical algorithms for tasks ranging from factorising large integers to simulating large quantum-mechanical systems.

Lectures and problem classes will be held in Maths SM2 at 9am on Tuesdays, Wednesdays and Thursdays.

The drop-in session (office hour) will be Thursdays, 1.30-2.30pm. Ashley's office is room 3.8 in the main Maths building.


Tentative schedule:

Week commencingTuesday 9amWednesday 9amThursday 9am
23 JanIntroduction
Computational complexity
The quantum circuit modelOracles and the Deutsch-Jozsa algorithm in the quantum circuit picture
30 JanGrover's algorithmGrover's algorithm (ctd)Discuss exercises 1
Extensions of Grover's algorithm
6 FebThe QFT and periodicityShor's algorithmDiscuss exercises 2
Shor's algorithm (ctd)
13 FebApproximate periodicityPhase estimationDiscuss exercises 3
Hamiltonian simulation
20 FebHamiltonian simulation (ctd)DecoherenceDiscuss exercises 4
Quantum error-correction
27 FebQuantum error-correction (ctd)
The stabilizer formalism
The stabilizer formalism (ctd)
Discuss exercises 5
Experimental quantum computing (Dr Dylan Mahler)

Assessment: Exercise sheets will be provided and discussed in problems classes. Final assessment for the unit will be a 1.5-hour written exam. An example exam question will be provided.