Quantum Information (SS13)

 

Lecture held in 28 B 110 on Mondays 10.00-11.30 and Fridays 11.45-13.15. Exercise session in 28 B 110 held on Mondays 11.45-13.15 with Nikolas Breuckmann & Firat Solgun.

Overview:

Part I: Quantum information formalism & basic quantum optics. In what way is quantum information different from classical information. Concepts: quantum entanglement, quantum information protocols such as quantum teleportation, quantum cryptography and Bell inequalities. Lectures 1-6.

Part II: Computation: classical and quantum. Quantum circuits, quantum algorithms such as phase-estimation and Grover's algorithm, quantum and classical simulation. Lectures 7-13.

Part III: Physical realization of quantum information. Examples taken from NMR, cavity QED, spin qubits and superconducting Josephson-junction qubits. Concepts: single and two-qubit gates, quantum measurement, Rabi oscillations, Lindblad formalism, superoperators, relaxation and decoherence, dynamical decoupling techniques. Lectures 14-25.

  • Lecture 1 (April 12). History, review of formalism. Problem Set 1 . A Lego Turing Machine (quantum model not yet available).
  • Lecture 2 + 3 (April 15+19). Review of formalism: quantum measurement, entanglement for qubits, bosonic and fermionic systems. Problem Set 2 .
  • Lecture 4 + 5 (April 22+16). No cloning, disturbance versus information gain, quantum key distribution, quantum teleportation, Bell inequalities. Problem Set 3 .
  • Lecture 6 (April 29). Linear Optics I.
  • Lecture 7 + 8 (May 3+6). Quantum Circuits and Gates. Introduction to Complexity Theory (by A. Nayak, Waterloo) I and II . Problem Set 4.
  • Guest Lecture (9) by Shabir Barzanjeh (May 10). Linear Optics II. Lecture based on "Quantum Optics" (Scully & Zubairy, Cambridge University Press, 1997), chapter 3, page 72-96. Problem Set 5.
  • Lecture 10 + 11 (May 13+17). Quantum algorithms. Problem Set 6.
  • NO LECTURES WEEK MAY 20-24
  • Lecture 12 + 13 (May 27+31). Quantum and classical simulation. Problem Set 7.
  • Lecture 14 + 15 (June 3+7). Single Qubit Gates, Rabi Oscillations. Problem Set 8.
  • Lecture 16 + 17 (June 10+14). Noise descriptions: superoperators, decoherence and relaxation. Problem Set 9.
  • Lecture 18 +19 (June 17+21). Lindblad formalism, Spin echo & dynamical decoupling techniques. Problem Set 10 .
  • Lecture 20 + 21 (June 24+28). Spin Qubits. Two Guestlectures by Prof. DiVincenzo June 28. Problem Set 11 .
  • Lecture 22 + 23 (July 1+July 5). Superconducting Qubits I. Problem Set 12 . Background Reading Material: Lectures by Devoret (Les Houches 1995) Martinis/Osborne (Les Houches 2003), Girvin (in draft form, based on lectures at Les Houches 2011).
  • Lecture 24 + 25 . Superconducting Qubits II. (July 8+12).
  • Lecture 26 (+ 27 ). Quantum Error Correction (July 15). NO LECTURE on July 19, but presentations on Friday Aug. 2, 9.30-13.00 in 26C401

Presentations will be on the following topics:

Dissipation Engineering

Measurement-Based Quantum Computation

NV Centers in Diamond

Quantum Repeaters

Quantum Money

Josephson Parametric Amplifiers

Reading Material/Lecture Notes

Lecture notes are available during the course. As a reference book (available at the Physikbibliothek and more copies at the Lehrbuchsammlung der Hochschulbibliothek), we recommend

1. Quantum Computation and Quantum Information by M.A. Nielsen and I.L. Chuang (Cambridge University Press) available at amazon.de. We advise you to get this book. Ten copies of this book are also available for loan in the Lehrbuchsammlung of the Hochschulbibliothek.

Material will also be used from the excellent book:

2. Exploring the Quantum , Atoms, Cavities, and Photons by Serge Haroche and Jean-Michel Raimond (Oxford Graduate Texts).

Beyond these, other good books or background sources of information are:

  • Book Quantum Computer Science: An Introduction by David Mermin (Cambridge University Press 2007). Chapters are available online.
  • Book Quantum Information by Stephen M. Barnett (Oxford University Press 2009).

Lectures Notes of Quantum Computation Course by John Preskill at Caltech are available here.

Credit

60% of grade will be based on completed homework (Problem Sets) and 40% of grade will be based on a presentation+written report. Presentations (blackboard or powerpoint) should be 20 minutes long+10 minutes question time. Written reports (max. 5 pages) should be handed in before Friday Aug. 9.

Problem Sets will be handed out every Friday Day X and can be worked on during the Exercise Session on Monday Day X+3 and should be handed in on or before Monday Day X+10. Problem Sets of Day X will be discussed on Monday Day X+10.