 |
Group seminar
Theoretical quantum science and technology
(Every term)
Group members will present and discuss their latest progress and results and give tutorial talks. Some talks will also be given by (external) visitors.
Students are always very welcome, credits can be obtained by a presenting something of interest (e.g., a research paper).
Comments are always welcome at (teaching@mkliesch.eu).
Time and place: Mondays 10:30h, either in the seminar room 25.32.03.51 or in the “Hilbtertraum” 25.32.03.48.
Topics
Quantum information theory
Quantum many-body physics
Characterization, verification and validation of quantum computing components
Simulations of complex quantum systems
Applied math
Machine learning in quantum physics
Schedule 2020
February
05 | 10:30h | Discussion of ’Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices’
Schedule 2019
December
16 | Raphael will tell us about his ongoing work.
09 | Biswash will speak about ’Entanglement properties of quantum grid states’.
02 | Alexander will speak about quantum walks.
November
25 | Lennar will tell us something about his ongoing work
18| Discussion of ’Predicting Features of Quantum Systems using Classical Shadows’
14| (Thursday, 10:30h) Daniel will present the results of his Master's thesis (joint group seminar with Bruss’ group)
11| Raphael will tell us about the theory of time management (not physics related but intended to help to get important work done)
04| 2nd discussion of ’Efficiently Maximizing a Homogeneous Polynomial over Unit Sphere without Convex Relaxation’ with a focus on the Alorithm (12) on page 7 and Section 3.2
October
28| Thomas will tell us about ’Adaptive weight estimator for quantum error correction’
21| Discussion of ’Efficiently Maximizing a Homogeneous Polynomial over Unit Sphere without Convex Relaxation’ with a focus on the Alorithm (12) on page 7 and Section 3.2
14| Discussion of practical requirements for quantum error correction based on ’Surface codes: Towards practical large-scale quantum computation’
07| Discussion of ’'quantum supremacy’’ and the famous paper draft by Google ’Quantum supremacy using a programmable superconducting processor’
August
09 | Arxiv watching before summer break: Everyone chooses two of the papers from the last 4 weeks and gives a short summary (main results and a bit of context).
July
12 | Raphael and Lennart will tell us about the quantum information workshop in Benasque.
June
28 + July 05 | Group in Benasque.
21 | Discussion of randomized benchmarking with (long version) and interleaved randomized benchmarking.
14 | Discussion of “Linear-time general decoding algorithm for the surface code”.
7 | Discussion of “Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes”.
May
31 | Effective holidy
24 | Discussion: Classical simulations of quantum circuits using the phase space formalism.
17 | Continuation of the discussion from last time, starting with Section 2.2.2.
10 | Raphael will lead a discussion on stabalizer states, mainly based on Chapter 2.2 of “Entanglement in Graph States and its Applications”.
03 | Paper discussion: “Quantum advantage with shallow circuits” and, possibly a follow-up “Quantum advantage with noisy shallow circuits in 3D”
April
26 | Daniel Miller will talk about “Propagation of generalized Pauli errors in qudit Clifford circuits” and a follow-up project on “Beating the PLOB bound with error-corrected qudit repeaters”.
12 | Raphael will lead a discussion on “Locally accurate MPS approximations for ground states of one-dimensional gapped local Hamiltonians”.
05 | Martin will speak about “Sample complexity of device-independently certified 'quantum supremacy’”.
March
29 | Discussion of local purifications
22 | Lennart will provide an overview of his current work on tensor networks:
Analyze challenges when simulating large scale quantum networks with tensor networks.
Event simulation of quantum operations
Distributed and parallelized computation
Simulation of decoherence with purified states may provide a scalable approach for few quibit nodes.
14 | (Moved from Friday to Thursday 10:30h) Raphael will tell us about his project.
08 | Discussion of variational quantum algorithms starting with the paper “A variational eigenvalue solver on a quantum processor”. Also the latest developments are of interest, see “Computational speedups using small quantum devices”.
01 | No group meeting (Carnival)
February
01 | Discussion of Construction of exact constants of motion and effective models for many-body localized systems.
05, 10:30h | Our visitor Jonas Haferkamp will tell us that Contracting projected entangled pair states is average-case hard.
07 | Discussion of gate set tomography, see the original paper and an introduction.
15 | Discussion of an active topic
22 | MK absent
January
11 | Raphael Brieger will speak about:
How many samples are needed to decide whether or not samples come from a targeted distribution?.
18 | Lennart Bittel speaks about the preparation of ground states on a quantum computer,
see e.g., Faster ground state preparation and high-precision ground energy estimation with fewer qubits and Quantum algorithm for preparing the ground state of a system via resonance transition.
25 | Martin Kliesch presents the main theorem and proof of Local integrals of motion and the logarithmic lightcone in many-body localized systems.
Schedule 2018
December
07 | Visitor: Ben Criger (Delft) will speak about quantum error correction,
see Multi-path Summation for Decoding 2D Topological Codes.14->19 | Moved to 19th: Ingo Roth (FU Berlin) visiting
November
02 | Canceled due to moved lecture
09 | Raphael Brieger will speak about From estimation of quantum probabilities to simulation of quantum circuits.
16 | Lennart Bittel will speak about Restricted Boltzmann machine quantum states.
23 | Reading group mode: we will discuss the methods used in the papers A quantum-inspired classical algorithm for recommendation systems and Quantum-inspired classical algorithms for principal component analysis and supervised clustering
30 | Reading group mode: further discussion of A quantum-inspired classical algorithm for recommendation systems and of the underlying method Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations
October
12 | Our visitor Markus Heinrich will speak about his work Robustness of Magic and Symmetries of the Stabiliser Polytope
19 | Martin Kliesch will speak (overview talk)
26 | Martin Kliesch absent
March
01 | Discussion of an active topic
08 | Discussion of an active topic
(Voluntary speakers are always welcome!)