Quantum Computation 2019

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 at 11am Tuesday (Maths SM2), 10am Wednesday (Maths SM2) and 2pm Thursday (Maths SM1).

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


Tentative schedule:

Week commencingTuesday 11amWednesday 10amThursday 2pm
28 JanIntroduction
Computational complexity
The quantum circuit modelOracles and the Deutsch-Jozsa algorithm in the quantum circuit picture
4 FebGrover's algorithmGrover's algorithm (ctd)Discuss exercises 1
Extensions of Grover's algorithm
11 FebThe QFT and periodicityShor's algorithmDiscuss exercises 2
Shor's algorithm (ctd)
18 FebApproximate periodicityPhase estimationDiscuss exercises 3
Hamiltonian simulation
25 FebHamiltonian simulation (ctd)DecoherenceDiscuss exercises 4
Examples of quantum channels
4 MarQuantum error-correction
Discuss exercises 5
Quantum error-correction (ctd)
Guest lecture: Fault tolerant quantum computation (Dominic Verdon)

Assessment: Exercise sheets will be provided and discussed in problems classes. Final assessment for the unit will be a 1.5-hour written exam. Past exam papers are available on the School of Mathematics student intranet.