# Lectures, seminars and dissertations

* Dates within the next 7 days are marked by a star.

Anne Schreuder (Cambridge University)

**On Lévy-driven Loewner Evolutions **

*** ** Thursday 08 December 2022, 10:15, Y405

This talk is about the behaviour of Loewner evolutions driven by a Lévy process. Schramm's celebrated version (Schramm-Loewner evolution), driven by standard Brownian motion, has been a great success for describing critical interfaces in statistical physics. Loewner evolutions with other random drivers have been proposed, for instance, as candidates for finding extremal multifractal spectra, and some tree-like growth processes in statistical physics. Questions on how the Loewner trace behaves, e.g., whether it is generated by a (discontinuous) curve, whether it is locally connected, tree-like, or forest-like, have been partially answered in the symmetric alpha-stable case. We consider the case of general Levy drivers. Joint work with Eveliina Peltola (Aalto and Bonn).

mathematical physics seminar (Kytölä, Peltola, Sahlsten)

Vivian Healey (Texas State University)

**TBA**

Thursday 15 December 2022, 10:15, Y405

mathematical physics seminar (Kytölä, Peltola, Sahlsten)

Rahinatou Yuh Njah

**Lattice-based cryptography (NB: unusual time!)**

Thursday 15 December 2022, 13:15, M3 (M234)

ANTA Seminar

Tuomas Tuukkanen (Princeton & Aalto)

**[MSc thesis presentation]**

Friday 16 December 2022, 11:00, M3 (M234)

mathematical physics seminar (Kytölä / Peltola / Sahlsten)

Tuomas Sahlsten

**TBA**

Wednesday 18 January 2023, 12:15, M3 (M234)

Seminar on analysis and geometry

Wilmar Bolanos

**TBA**

Wednesday 18 January 2023, 16:15, M3 (M234)

ANTA Seminar

**Systeemitieteiden kandidaattiseminaari / Bachelor seminar in systems analysis**

Friday 20 January 2023, 09:30, Riihi (Y225a)

Further information

Prof. Alexandru Paler

**Graph states and the challenges for efficient quantum circuit compilation**

Wednesday 25 January 2023, 16:15, M3 (M234)

Graphs can be used as a diagrammatic representation of entangled states: vertices represent qubits, and edges are the entangling gates performed between the qubits. Arbitrary quantum circuits can be compiled into a fault-tolerant gate set, and the resulting circuit can be reformulated as a graph state. Such graphs can be manipulated by local operations (single qubit/vertex gates) such that edges are added and removed in a well defined manner during a process called local complementation. The latter might have interesting applications for the optimisation of (fault-tolerant) quantum circuits, quantum communication networks and in general whenever, either: a) there is a need to minimize the number of edges (entangling gates) without affecting the functionality of the state, or b) the state has to be embedded into a quantum hardware architecture that has a different connectivity. This talk is partially based on the work from https://arxiv.org/abs/2209.07345

ANTA Seminar

**Systeemitieteiden kandidaattiseminaari / Bachelor seminar in systems analysis**

Monday 06 March 2023, 09:30, Riihi (Y225a)

Further information

Stephen Moore (Institute of Mathematics Polish Academy of Sciences)

**TBA**

Thursday 09 March 2023, 10:15,

mathematical physics seminar (Kytölä, Peltola, Sahlsten)

**Systeemitieteiden kandidaattiseminaari / Bachelor seminar in systems analysis**

Monday 17 April 2023, 09:30, Riihi (Y225a)

Further information

**Systeemitieteiden kandidaattiseminaari / Bachelor seminar in systems analysis**

Tuesday 16 May 2023, 09:30, Riihi (Y225a)

Further information

**Systeemitieteiden kandidaattiseminaari / Bachelor seminar in systems analysis**

Friday 16 June 2023, 09:30, Riihi (Y225a)

Further information

Show the events of the past year

Page content by: webmaster-math [at] list [dot] aalto [dot] fi