Events for 11/18/2024 from all calendars

Geometry Seminar

Time: 3:00PM - 3:50PM

Location: BLOC 302

Speaker: Therese Wu, University of Houston

Title: Moduli Spaces in Graph Theory and Comparison Theorems

Abstract: A moduli space is a parameter space for classes of geometric objects of interest. A desirable property of moduli space is that nearby points in the moduli space specify nearby objects. Moduli spaces can be thought of as giving a universal space of parameters for geometric objects. The moduli space contains rich information about that object and consequently provides information to discover or construct the object being parameterized by the moduli space. The moduli space of trees and the moduli space of networks are homeomorphic to algebraic fans spanned by root subsystems of type D that arise in the moduli space of smooth marked del Pezzo surfaces. I will also briefly introduce how they are tied to the moduli space of algebraic curves and extend to the moduli space of super curves, which are algebraic curves with additional supersymmetric or supergeometric structures. I will conclude my talk with an exposition on the construction of dual graphs of SUSY curves with Neveu–Schwarz and Ramond punctures and describe how the moduli space of genus 0 SUSY graphs coincides with the aforementioned moduli space of trees.

Departmental Colloquia

Time: 4:00PM - 5:00PM

Location: BLOC 117

Speaker: Zhiyan Ding

Title: Quantum Eigenvalue(phase) Estimation: From Quantum Data to Classical Signal Processing

Abstract: Quantum eigenvalue(phase) estimation is one of the most important quantum primitives. While numerous quantum algorithms have been proposed to tackle this problem, they often demand substantial quantum resources, making them impractical for early fault-tolerant quantum computers. The talk will begin with a quantum oracle that transforms the quantum eigenvalue estimation problem into a classical signal processing problem. I will then introduce a simple classical subroutine for solving this problem, which surprisingly achieves state-of-the-art complexity results. Additionally, I will review the performance of traditional classical algorithms for this problem and share new insights gained from our study.