|
|
1
- Talk on "Societal Computing: Computing Of and For Society" by Ingmar Weber (Fachrichtung Informatik - Saarbrücken)
Talk on "Societal Computing: Computing Of and For Society" by Ingmar Weber (Fachrichtung Informatik - Saarbrücken) 1st März 2023 12:15 pm - 1:15 pm https://domino.mpi-inf.mpg.de/internet/events.nsf/0/BFFD9321722F6405C1258951004E357F See more details
• |
2
- Talk on "Quantum Pseudoentanglement" by Adam Bouland (Standford University)
Talk on "Quantum Pseudoentanglement" by Adam Bouland (Standford University) 2nd März 2023 5:00 pm - 6:00 pm Title: Quantum Pseudoentanglement Abstract: Quantum pseudorandom states are efficiently constructable states which nevertheless masquerade as Haar-random states to poly-time observers. First defined by Ji, Liu and Song, such states have found a number of applications ranging from cryptography to the AdS/CFT correspondence. A fundamental question is exactly how much entanglement is required to create such states. Haar-random states, as well as t-designs for t≥2, exhibit near-maximal entanglement. Here we provide the first construction of pseudorandom states with only polylogarithmic entanglement entropy across an equipartition of the qubits, which is the minimum possible. Our construction can be based on any one-way function secure against quantum attack. We additionally show that the entanglement in our construction is fully "tunable", in the sense that one can have pseudorandom states with entanglement Θ(f(n)) for any desired function ω(logn)≤f(n)≤O(n). More fundamentally, our work calls into question to what extent entanglement is a "feelable" quantity of quantum systems. Inspired by recent work of Gheorghiu and Hoban, we define a new notion which we call "pseudoentanglement", which are ensembles of efficiently constructable quantum states which hide their entanglement entropy. We show such states exist in the strongest form possible while simultaneously being pseudorandom states. We also describe diverse applications of our result from entanglement distillation to property testing to quantum gravity. Based on joint work with Bill Fefferman, Soumik Ghosh, Umesh Vazirani, and Zixin Zhou, arXiv:2211.00747 Location https://zoom.us/j/94577321297?pwd=N3l5K1ZtZ3E1aytnWlBkL1FUazNXZz09 Meeting ID 945 7732 1297 Passcode 205903 Host: Kurt Mehlhorn (MPI-INF). Information about the series and recordings of previous talks can be found at https://www.mpi-inf.mpg.de/departments/algorithms-complexity/quantum-lecture-series See more details
• |
3
- Talk on "From Resource Allocation to Machine Learning: Fairness Through Computation and Fairness in Computation" by Bhaskar Ray Chaudhury (University of Illinois Urbana-Champaign, USA)
Talk on "From Resource Allocation to Machine Learning: Fairness Through Computation and Fairness in Computation" by Bhaskar Ray Chaudhury (University of Illinois Urbana-Champaign, USA) 3rd März 2023 9:30 am - 10:30 am Bhaskar Ray Chaudhury (University of Illinois Urbana-Champaign, USA) See more details
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 3rd März 2023 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
• • |
4 |
5 |
6
- Lehrerfortbildung "Einführung in Godot - Eine Open Source Entwicklungsumgebung für Videospiele"
Lehrerfortbildung "Einführung in Godot - Eine Open Source Entwicklungsumgebung für Videospiele" 6th März 2023 8:00 am - 4:30 pm https://uni-saarland.us20.list-manage.com/track/click?u=997406072676c8ace8a944a4b&id=d3d90b74e0&e=55e0ebfed1 See more details
• |
7 |
8 |
9
- Talk on "E 3.0 - Even Faster, Much Higher, Still Stronger" by Stephan Schulz (DHBW Stuttgart)
Talk on "E 3.0 - Even Faster, Much Higher, Still Stronger" by Stephan Schulz (DHBW Stuttgart) 9th März 2023 9:00 am - 10:00 am https://domino.mpi-inf.mpg.de/internet/events.nsf/0/0B8E2D36FB936D00C125896300394A26 See more details
- Talk on "Fair, Representative, and Transparent Algorithms for Citizens’ Assemblies" by Paul Gölz (Havard John A. Paulson School of Engineering and Applied Sciences, USA)
Talk on "Fair, Representative, and Transparent Algorithms for Citizens’ Assemblies" by Paul Gölz (Havard John A. Paulson School of Engineering and Applied Sciences, USA) 9th März 2023 9:30 am - 10:30 am https://domino.mpi-inf.mpg.de/internet/events.nsf/0/AFD1558F6C7EA09FC125895E004A2C54 See more details
- Promotionskolloquium "Classification and homological invariants of compact quantum groups of combinatorial type" von Alexander Mang
Promotionskolloquium "Classification and homological invariants of compact quantum groups of combinatorial type" von Alexander Mang 9th März 2023 12:30 pm - 1:30 pm am Donnerstag, 9. März 2023, um 12:30 Uhr in Gebäude E2 4, HS IV Titel: “Classification and homological invariants of compact quantum groups of combinatorial type“ Die Arbeit wurde von Prof. Dr. Moritz Weber betreut. Abstract: Compact quantum groups can be found by solving certain combinatorics problems, as first shown by Banica and Speicher. In particular, Tarrago and Weber proved that any system of decorated partitions of finite sets which is closed under reflection and two kinds of concatenation gives rise to a quantum subgroup of the free unitary quantum group. The effort to describe all these quantum relatives of the classical matrix groups has advanced to the point where only so-called hyperoctahedral ones remain to be found, the most plentiful and most difficult examples. Classifying them in part, a family of non-hyperoctahedral quantum groups can be recognized by observing that certain colored orders induced by a *-betweenness relation between the blocks of the partitions are stable under reflection and concatenation. While constructions as the one described produce numerous examples of quantum groups, little is known about which of those are actually new and not just known ones in disguise. For instance, it can be proved that any such quantum group interpolating the unitary group and the free unitary quantum group can be written as a quotient of a wreath graph product of one of the two. One way of making distinctions is to study quantum group invariants, such as cohomology. For example, it is possible to compute the first order with trivial coefficients for the discrete duals of all of Tarrago and Weber’s quantum groups, even the ones not yet classified. Finally, the kind of construction sketched above, giving rise to quantum groups of combinatorial type, can be understood in the abstract terms of categories of generalized relations with respect to orthogonal factorization systems. While much remains to be investigated further, one can prove in this framework theorems which hold for all reasonably well-behaved constructions. See more details
- Promotionskolloquium "On a Notion of Abduction and Relevance for First-Order Logic Clause Sets" von Fajar Haifani
Promotionskolloquium "On a Notion of Abduction and Relevance for First-Order Logic Clause Sets" von Fajar Haifani 9th März 2023 2:00 pm - 3:00 pm am Donnerstag 09. März 2023 um 14:00 Uhr in Gebäude E1 4, MPII, Raum 0.24 Titel: “On a Notion of Abduction and Relevance for First-Order Logic Clause Sets“ Die Arbeit wurde von Prof. Dr. Christoph Weidenbach und Dr. Sophie Tourret betreut. Abstract: I propose techniques to help explain entailment and non-entailment in first-order logic. For entailment, I classify clauses necessary for any possible deduction (syntactically relevant), usable for some deduction (syntactically semi-relevant), or unusable (syntactically irrelevant) along with a semantic characterization via conflict literals (contradictory simple facts). This offers a novel insight beyond the existing notion of minimal unsatisfiable set. The need to test if a clause is syntactically semi-relevant leads to a generalization of the completeness result of a well-known resolution strategy: resolution with the set-of-support (SOS) strategy is refutationally complete on a clause set N and SOS M if and only if there is a resolution refutation from N ∪ M using a clause in M. For non-entailment, abductive reasoning helps find extensions of a knowledge base to obtain an entailment of some missing consequence. I focus on EL TBox abduction that is lightweight but prevalent in practice. The solution space can be huge so, to help sort the chaff from the grain, I introduce connection-minimality, a criterion such that accepted hypotheses always immediately relate the observation to the given axioms. I show that such hypotheses are computable using prime implicate-based abduction in first-order logic. I evaluate this notion on ontologies from the medical domain using an implementation with SPASS as a prime implicate generation engine. See more details
• • • • |
10
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 10th März 2023 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
• |
11 |
12 |
13
- Promotionskolloquium "Monte-Carlo methods for backwardstochastic differential equa-tions: Segment-wise dynamic programming and fast rates for lower bounds" von Steffen Meyer
Promotionskolloquium "Monte-Carlo methods for backwardstochastic differential equa-tions: Segment-wise dynamic programming and fast rates for lower bounds" von Steffen Meyer 13th März 2023 10:00 am - 11:00 am am Montag, 13. März 2023 um 10:00 Uhr in Gebäude E2 4, HS IV Titel: “Monte-Carlo methods for backwardstochastic differential equa-tions: Segment-wise dynamic programming and fast rates for lower bounds“ Die Arbeit wurde von Prof. Dr. Christian Bender betreut. Abstract: In this talk we cover two different algorithms using Monte-Carlo methods for solving backward stochastic differential equations. We first present a new algorithm where the backward stochastic differential equation is discretized to a dynamic programming equation using a multi-step forward approach on segments of the time grid. Appearing conditional expec-tations are computed via least squares regression on function spaces. We op-timize the length of the segments in dependence on the dimension and smoothness of the backward stochastic differential equation and compute the complexity needed to achieve a desired accuracy in the limit as the number of time points in the discretization goes to infinity. Additionally we briefly cover an algorithm for the construction of lower bounds for the solution at time zero. This algorithm uses a pre-computed ap-proximate solution of the BSDE to sample a control process which are then used to derive the lower bound for the solution. See more details
• |
14
- InfoLabSaar - AstroPi Mission Zero
InfoLabSaar - AstroPi Mission Zero 14th März 2023 4:00 pm - 5:30 pm https://infolab.cs.uni-saarland.de/2023/03/08/astropi-programmieren-fuer-die-iss-2/ See more details
• |
15 |
16
- Lehrerfortbildung "KI ohne Strom: Künstliche Intelligenz ohne Computer unterrichten"
Lehrerfortbildung "KI ohne Strom: Künstliche Intelligenz ohne Computer unterrichten" 16th März 2023 3:00 pm - 6:00 pm https://uni-saarland.us20.list-manage.com/track/click?u=997406072676c8ace8a944a4b&id=1a6cb44401&e=55e0ebfed1 See more details
• |
17
- Studieninfotage: Vorstellung der MINT-Studiengänge
Studieninfotage: Vorstellung der MINT-Studiengänge 17th März 2023 https://www.uni-saarland.de/aktuell/studieninfotage-vorstellung-der-mint-studiengaenge-26275.html See more details
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 17th März 2023 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
• • |
18
- CoderGirls
CoderGirls 18th März 2023 11:00 am - 1:00 pm https://stadtbibliothek.saarbruecken.de/veranstaltungen/veranstaltungen/veranstaltungs_detailseite/event-62389d18d5900 See more details
• |
19 |
20 |
21 |
22 |
23 |
24
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 24th März 2023 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
• |
25 |
26 |
27
- 5. Tag des Informatikunterrichts
5. Tag des Informatikunterrichts 27th März 2023 8:30 am - 3:30 pm https://informatikdidaktik.cs.uni-saarland.de/2023/01/26/5-tag-des-informatikunterrichts/ See more details
• |
28 |
29 |
30
- Talk on "Learning Lunch: The Gender Data Gap - And its Implications for Data-Driven Decision Making" by Meike Zehlike (Zalando Research)
Talk on "Learning Lunch: The Gender Data Gap - And its Implications for Data-Driven Decision Making" by Meike Zehlike (Zalando Research) 30th März 2023 11:30 am - 12:45 pm https://domino.mpi-inf.mpg.de/internet/events.nsf/0/1CC5A7B95774D89AC12589670049C34B See more details
• |
31
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 31st März 2023 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
• |
|
|