Instructional Course in Quantum Computing
Edinburgh, 27-31 March 2000
|Course Home Page | Scientific Programme | Course Arrangements|
Provisional Timetable & TopicsThis is a provisional timetable of lectures as at 8 March 2000. It will be altered if there are any changes and a final timetable will be included in the registration pack.
Speakers topics are listed below the timetable in order of presentation. Likewise, any changes will be made here and included in the registration pack.
NOAH LINDEN (2 talks)
Introduction to quantum mechanics and entanglement
State space. Qubits. Superposition. Concept of entanglement. Idea of unitary operations. Measurement/probabilities. Idea of density matrices. Measurements on a subsystem. Bell states, GHZ states, idea of local operations and classical communication.
RICHARD JOZSA (3 talks)
Algorithms and complexity
Basic idea of computational complexity. Gate array model of quantum computation. Notions of P,BPP,BQP,NP. Hadamard gate. Deutsch algorithms. Periodicity and Fourier transform. Shor's algorithm. Quantum searching and its relation to NP. Idea of amplitude amplification.
CHRIS FUCHS (3 talks)
The setting of the communication problem. Background on Shannon information function. Dense coding. General quantum signals: mixed states and von Neumann entropy. Holevo bound. Classical information capacity: idea of multiple shots/superadditivity. Idea of quantum information transfer. Concept of typical subspace and outline of Schumacher compression.
SANDU POPESCU (3 talks)
Quantum information, entanglement manipulations
Re-iterate idea of quantum information. No-cloning. Teleportation. Quantifying entanglement. Entanglement dilution and concentration in pure states. Entanglement purification in mixed states. Idea of bound entanglement. Multi-particle entanglement. GHZ example.
DAVID DIVINCENZO (2 talks)
Description of the most prominent proposals for physical implementation of quantum computation. The idea of decoherence. Assessment of limitations of proposals.
ANDREW STEANE (2 talks)
Quantum error correction, fault tolerance
Idea of error correcting codes. Model of errors in quantum states: reduction of general errors to 3 basic kinds. Basic role of Hadamard gate. Simple example of a quantum error correcting code. Basic idea of fault tolerance, statement of main theorem.
HARRY BUHRMAN (3 talks)
Limitations of quantum computing and quantum communication complexity
Limitations of quantum computing. The polynomial method and how to use it to prove impossibility results with respect to quantum computing. The relation between these results and complexity theory. Quantum communication complexity. Introduction to communication complexity. Extension to the quantum setting: exchanging qubits, and/or prior shared entanglement. Discussion of basic results comparing classical and quantum communication complexity.
HOI-KWONG LO (2 talks)
The idea of key distribution. Basic quantum protocols. A discussion of security. Other cryptographic tasks, for example quantum money, bit commitment.
This meeting's pages last updated 9 March 2000
|Back to ICMS Website|