QuCoLiMa Topical Days
QuCoLiMa Topical Days are internal workshops of TRR 306. They are organized to promote internal exchange regarding specific subjects and technical aspects connected to the TRR 306.
Quantum Computers: from Basics to Compilers
The topical days are this time especially meant for the members of the RTG. There will be talks on quantum computing, on quantum algorithms, and on the quantum internet. Moreover, there will be three interactive sessions of tutorials on programming with quantum computers / neural network quantum states.
Beginning: | Wednesday, November 29th, 13:45 |
End: | Friday December 1st, 12:00 |
Place: | Campus, Universität des Saarlandes, 66123 Saarbrücken |
Program
Wednesday November 29th
13:45-15:00 |
Quantum computers – from basics to compilers: Welcome and 1st session |
Horsaal 1, Geb E2.5 |
13:45-14:15 |
Welcome |
Giovanna Morigi (UdS) |
14:15-15:00 |
Quantum Computing: A Classical Perspective |
Antonio Macaluso (DFKI, Saarbrücken) |
15:00-15:30 |
Coffee Break |
|
15:30-18:00 |
Laboratoy on neural network quantum states for open systems |
Horsaal 1, Geb E2.5 |
15:30-16:30 |
• Phase I: Neural network quantum states |
Marjan Macek and Michael Hartmann (FAU) |
16:30-18:00 |
• Phase II: Introduction to the code library for neural network quantum states |
Marjan Macek and Michael Hartmann (FAU) |
19:30 |
Dinner |
Thursday November 30th
9:00-12:30 |
Focus session: Quantum computing |
Graduate Center C9 3 |
9:00-10:00 |
The quantum internet |
Jürgen Eschner (UdS) |
10:00-10:45 |
Basics of (Quantum) Algorithmic complexity |
Markus Bläser (UdS) |
10:45-11:15 |
Coffee Break |
|
11:15-12:00 |
The variational quantum algorithm: An introduction |
Peter Orth (UdS) |
12:00-12:45 |
A mathematical framework for quantum information |
Moritz Weber (UdS) |
12:45-14:00 |
Lunch Break |
|
14:00-17:30 |
Intermediate quantum computing laboratory |
Graduate Center C9 3 |
14:00-15:00 |
• Phase I: Review and discuss the self-test problems |
F. Wilhelm-Mauch, T. Stollenwerk, & Team (FZJ) |
15:00-16:00 |
• Phase II: Discuss the material previously distributed |
F. Wilhelm-Mauch, T. Stollenwerk, & Team (FZJ) |
16:00-17:30 |
• Phase III: Start working together on a new set of problems |
F. Wilhelm-Mauch, T. Stollenwerk, & Team (FZJ) |
19:00 |
Dinner |
Friday December 1st
9:00-12:00 |
The Ion Trap Quantum Computer |
U.39 Zeichensaal, Geb E25 |
9:00-10:00 |
Part 1: The Ion Trap Quantum Computer at Mainz |
J. Hilder and F. Schmidt-Kaler (JGU) |
10:00-12:00 |
Part 2: An introduction to the compiler and user interface. |
J. Hilder and F. Schmidt-Kaler (JGU) |
12:00 |
End of the workshop |
Description of interactive sessions
Simulating quantum many-body systems on classical computers is extremely challenging because the number of degrees of freedom scales exponentially in the system size. Already for moderate system sizes, one needs to resort to approximation methods such as Monte Carlo or Tensor Network techniques. This laboratory introduces Neural-Network Quantum States, a parametrization of the quantum states in terms of neural networks, and how can they be used to learning a steady-state of an open system with Variational Monte Carlo technique.
Goals
- Understanding the basics of variational Monte Carlo with Neural Network Quantum States
- Understanding why and when Neural Network Quantum States provide good approximations
- Running a first example code using the NetKet library, see https://www.netket.org/
Prerequisites
- Good knowledge of quantum mechanics
- Coding experience in Python
- A working installation of NetKet
Quantum computers are an exciting development and their likely first application will be in the simulation of manybody quantum systems. Some systems are available online and programming environments as well as application frameworks are become somewhat mature. Standard notions of quantum computing are taught in courses and covered in textbooks and become more or less common knowledge of quantum-minded graduate students. This session is meant to take students to the next level.
Goals:
- understanding of the implementation of optimization algorithms on gate-based and adiabatic quantum computers
- understanding of the implementation of linear algebra algorithms on gate-based quantum computers
- understanding of the variational quantum eigensolver and the variational Hamiltonian Ansatz
- practice of these algorithms in IBM QISKIT
Prerequisites:
- Understanding of the quantum gate model
- Understanding of basic quantum algorithms including
- the Grover algorithm
- Quantum phase estimation
- a working instance of IBM QISKIT at your fingertips
Mode of instruction:
Before the laboratory the students will be required to follow online lectures. The laboratory will consist of in-presence discussions. Before the class, you will receive a download link with slides and recorded audio for you to review before as well as a set of test problems on the prerequisites. In the afternoon, we will do three things:
- review and discuss the self-test problems
- discuss the material from the slides
- start working together on a new set of problems
Our trapped ion quantum computers are based on modern segmented ion traps. We will sketch architectures, the required trap technologies and fabrication methods, control electronics for quantum register reconfigurations, and recent improvements of qubit coherence and gate performance. We will present various QC applications, including variational quantum eigensolver approaches for chemistry or high energy relevant models.
The session will provide a detailed inside in the full software stack needed to operate the trapped-ion quantum computer without specific hardware knowledge and from a remote location. This includes the integration of standardized user interfaces, such as Qiskit and PennyLane, as well as the compilation stack to translate a given arbitrary quantum circuit into an optimized shuttling-based operation sequence.
Goals
- Understanding the basics of trapped-ion quantum computers
- Understanding the parts of the software stack to control a trapped-ion quantum computer, including standard user interfaces, circuit representation on different compiler layers and operation sequences to be executed on the hardware
Prerequisites
- Good knowledge of quantum mechanics
- Understanding of basic quantum algorithms
Registration
Deadline for registration: November 9th, 2023
Measuring quantum correlations via photo-detection
About:
Optical measurement process, measurement-induced quantum correlations, measurement-induced phase transitions, …
Beginning: | Thursday September 29th, 12:00 |
End: | Friday September 30th, 16:00 |
Place: | Building C7.4 – Seminarraum 1.17 |
Preliminary Program
29.9.2022
12:00 | Arrival and Lunch |
14:00 – 17:00 | Talks by the PIs and/or senior members of the participating groups / overview of research and objectives |
17:00 – 17:30 | Coffee Break |
17:30 – 19:00 | Poster |
19:00 – 20:00 | To Hotel |
20:00 | Dinner |
30.9.2022
10:00 – 12:30 | Discussion in small groups |
12:30 – 14:00 | Lunch |
14:00 – 16:00 | Lab tour / Theory tour |
Deadline for registration: September 4th, 2022
– registration closed -1