Vorlesung: Brückenkurs (20000001)

• Vorlesender: Jens Eisert.
• Datum und Uhrzeit: Jeden Werktag 9:15-12:00 Uhr, vom 2. Oktober bis zum 13. Oktober, 2023, außer am Feiertag 3. Oktober.
• Raum: 0.3.12 Großer Hörsaal, Arnimallee 14.
• Fachbereichsseite: Diese findet sich hier. Aber Vorsicht, der dort gezeigte Skript ist nicht unserer.
• Grading of the course: Please fill in this form.
  
  
• Tutorien (20000002): Jeden Tag finden zwischen 14:15-17:00 Uhr Übungen statt in sechs verschiedenen Räumen.
  
  
  • Paul Faehrmann (Seminarraum E1)
  • Jonas Kitzinger (Seminarraum E2)
  • Jonathan Conrad (Seminarraum E3)
  • Ansgar Burchards (Seminarraum T1)
  • Leo Shtaposhnik (Seminarraum T2)
  • Frederik vom Ende (Seminarraum T3)

• Übungsblätter und deren Lösungen werden hier veröffentlicht.
  
  

• Skript: Dieser Kurs soll helfen, alle Studienanfänger/innen auf ein vergleichbares mathematisches Niveau zu bringen. Ganz besonders wichtig ist er für Schüler:innen, die keinen Mathematik-Leistungskurs absolviert haben - aber auch für Absolventen eines Leistungskurses ist er sehr zu empfehlen! Der Kurs wird in Blockform abgehalten. Der Kurs soll auch zeigen, dass Mathematik Spaß machen kann. Es gibt einen vollständig ausformulierten Skript, er ist hier zu finden.

Lecture: Quantum information theory (20110401)

• Lecturer: Jens Eisert
  
  
• On-site format: The lecture will be held on-site.
• Times: Mon 16:15-18:00, Wed 16:15-18:00
  Note that the course will start on October 23, 2023
  
• Place: 1.3.21 Seminarraum T1 (Arnimallee 14)
  
• Tutorials: We offer three tutorials. If a Monday tutorial does not take place, the students are kindly asked to distribute themselves among the other tutorials at the same time. For Tuesday tutorials, a replacement will be provided. Submission of the exercise sheets on paper is preferred, digital submissions can be made via e-mail to all tutors (see below).
• Tutors: Elies Gil-Fuster (e.gilfuster@fu-berlin.de), Johannes Jakob Meyer (jjmeyer@zedat.fu-berlin.de), Matthias Caro (matthias.caro@fu-berlin.de), Simon Cichy (simon.cichy@fu-berlin.de)

• Tutorial 1:
  
  - Time: Monday 10:15-12:00
  - Room: 1.3.21 Seminarraum T1

• Tutorial 2:
  
  - Time: Monday 10:15-12:00
  - Room: 1.3.48 Seminarraum T3 (Arnimallee 14)

• Tutorial 3:
  
  - Time: Tuesday 8:15-10:00
  - Room: Seminarraum E3 (Arnimallee 14)

• Problem sheets: The exercise sheets will be made available here:
  
  • Problem sheet 0 (solutions)
  • Problem sheet 1 (solutions)
  • Problem sheet 2 (solutions)
  • Problem sheet 3 (solutions)
  • Problem sheet 4 (solutions)
  • Problem sheet 5
  • Problem sheet 6

• Exam: The exam will take place in person.
• Retake exam: There will be a retake exam.

• Topic of the lecture:
  
  This course provides an overview of an exciting emerging field of research, that of quantum information theory. The field is concerned with the observation that single quantum systems used as elementary carriers of information allows for entirely new modes of quantum information processing and communication, quite radically different from their classical counterparts. Quantum key distribution suggests to communicate in a fashion, secure from any eavesdropping by illegitimate users. Quantum simulators can outperform classical supercomputers in simulation tasks. The anticipated - but now rapidly developing - devices of quantum computers can solve not all, but some delicate computational problems that are intractable on classical supercomputers. This course will give a comprehensive overview over these developments. At the heart of the course will be method development, setting the foundations in the field, building upon basic quantum theory. We will also make the point that quantum information is not only about information processing, but a mindset that can be used to tackle problems in other fields, most importantly in consensed matter research, with which quantum information is much intertwined for good reasons.
  
  
• Content:
  
  1. Introduction
  1.1 Some introductory words
  1.2 Quantum information: A new kind of information?
  
  2. Elements of quantum (information) theory
  2.1 Quantum states and observables
  2.2 Unitary time evolution
  2.3 Composite quantum systems
  
  3. Two possible machines
  3.1 Quantum teleportation
  3.2 Dense coding
  
  4. Quantum channels and operations
  4.1 Complete positivity
  4.2 Kraus theorem
  4.3 Local operations and classical communication
  
  5. Entanglement theory
  5.1 Pure state entanglement
  5.2 Mixed state entanglement
  
  6. Quantum Shannon theory
  6.1 Capacities as optimal rates
  6.2 A glimpse at quantum Shannon theory
  
  7. Quantum key distribution
  7.1 BB84 scheme
  7.2 Entanglement-based schemes
  7.3 Words on quantum technologies
  
  8. Elements of quantum computing
  8.1 Why quantum computing?
  8.2 From classical to quantum computing
  8.3 Gottesman-Knill and Solovay-Kitaev theorems
  
  9. Quantum algorithms
  9.1 Deutsch and Deutsch-Jozsa algorithm
  9.2 Grover’s database search algorithm
  9.3 Exponential speed-up in Shor’s factoring algorithm
  9.4 Some thoughts on quantum algorithmic primitives
  
  10. Quantum computational models
  10.1 Adiabatic quantum computing
  10.2 Measurement-based quantum computing
  10.3 Further models of quantum computing
  
  11. Notions of computational complexity
  11.1 Cost functions
  11.2 Complexity classes
  
  12. Non-universal quantum computers
  12.1 Quantum simulators
  12.2 Variational quantum computers
  12.3 Final thoughts
  
  13. Quantum error correction
  13.1 Peres Code
  13.2 Shor code
  13.3 Elements of a theory of quantum error correction
  13.4 Stabilizer codes and the toric code
  
  
• Literature: See the script.

• Lecturer: Jens Eisert
• Date and time: Contact the lecturer.