|![[Search]](http://talks.cam.ac.uk/images/search.gif?1209136071)
|![[A-Z Index]](http://talks.cam.ac.uk/images/az.gif?1209136071)
|![[Contact]](http://talks.cam.ac.uk/images/contact.gif?1209136071)
||![[University of Cambridge]](http://talks.cam.ac.uk/images/identifier2.gif?1209136071){kind=small} |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![[Talks.cam]](http://talks.cam.ac.uk/images/talkslogosmall.gif?1209136071) |
CCIMI short course: Quantum Computing - Theory and PracticeAdd 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.
|
