University of Cambridge > Talks.cam > CCIMI short course: Quantum Computing - Theory and Practice

Log in

Cambridge users (raven) details

Other users details

No account? details

Information on

Subscribing to talks details

Finding a talk details

Adding a talk details

Disseminating talks details

Help and Documentation details

CCIMI short course: Quantum Computing - Theory and Practice

Add to your list(s) Send you e-mail reminders

This short course is organised by the CCIMI and open to all. Lectures run 14:00-16:30, with a 15 minute break in the middle, Tuesday 1st – Thursday 3rd May.

Instructor: Lior Horesh, IBM

In this short course, fundamental theoretical concepts of quantum computation and quantum information will be covered. In addition, hands-on experimentation of quantum algorithms will be demonstrated on actual quantum devices. Special consideration will be given to realization of limitations of current, non-fault tolerant quantum systems, as well as means to mitigate them when possible.

Specifically, the short course will address the following topics:

Lecture 1 – a. Introduction and overview – historical review, quantum bits, quantum computation, quantum algorithms, quantum information, models of computation, complexity analysis. b. Algebraic preliminaries – Pauli matrices, adjoint, Hermitians and unitary operators, tensor product spaces, commutative and anti-commutative relations. c. Brief introduction to quantum mechanics – the postulates of quantum mechanics (state space, evolution, quantum measurement and composite systems).

Lecture 2 – a. The qubit – Bloch sphere, basis state, superposition, entanglement (Bell state example). b. Quantum computation – single qubit and controlled operations, universality, quantum circuits (super-dense coding and teleporation examples). c. Hands-on experimentation of quantum algorithms on a quantum system via the IBM (Quantum Experience http://research.ibm.com/ibm-q/).

Lecture 3 – a. Quantum algorithms: Deutsch, Deutsch Josza, Simon’s, quantum Fourier transform, quantum phase estimation, Grover’s search algorithm . b. Quantum noise and quantum operations: gate fidelities, amplitude leak, phase decoherence, algorithmic design considerations (Variational Quantum Eigensolver example)

No sign up or registration is required for this course.

It is useful for students to have a laptop/tablet (or even a smartphone) for some of the more practical examples, but this is not necessary. Those without computer access can follow a demo shown by the instructor.

Other views and ways to subscribe

Create Custom View
Subscribe using ical/vcal (Help with icalendar)
Subscribe to RSS feed
- please read notes first
Manage e-mail reminders
- see link at top of page
Plain Text View

You can include this list in your own website. Read the Instructions on how to include a list in your site and then click on 'Create Custom View' above to get started.

List Managers

Each talk has an organiser. Please contact them in the first instance if you have a query about a particular talk. Only contact one of the people below if you have a question about the list, such as whether your talk or series could be added.

(In order to see the manager's details, such as their e-mail, you will need to have an account and log in)

Lists included in this list

This list does not include any other list

Lists that include this list

Note that ex-directory lists are not shown.