Peter K. Friz (Technische Universität Berlin)
Rough Analysis and Applications (ONLINE) abstract
Abstract:
We plan to discuss: the algebra of iterated integrals, signatures and expected signatures, rough paths and models; Kolmogorov type criteria; Schauder estimates; p-variation, abstract Riemann-Stieltjes integration (Sewing); rough integration and reconstruction; a paracontrolled view; rough differential equations and flows; rough transport equations; second order rough partial differential equations; rough volatility; a regularity structure view; large deviations and precise asymptotics for rough volatility.A good part of the lecture will follow F-Hairer (2014,2020).
10:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room
Prof. Dr. Clara Löh (Universität Regensburg)
p-Adic simplicial volumes abstract
Abstract:
The simplicial volume of an oriented manifold is the l^1-semi-norm of the fundamental class with coefficients in a normed ring. The case of \\R-coefficients is Gromov\'s classicial simplicial volume, which is related to Riemannian geometry. In this talk, we will focus on p-adic versions, i.e., on \\Z_p- and \\Q_p-coefficients. These p-adic versions are related to p-power torsion in homology. The big picture is still somewhat unclear, but at least we can handle the surface case and there are some nice open problems. This is joint work with Steffen Kionke.
Marco Falconi (University of Roma Tre)
CANCELLED: Title T.B.A.
14:15 • Universität Basel, Fachbereich Mathematik, Spiegelgasse 1, Seminar Room 00.003
Prof. Dr. Victor Batista (Yale University)
Tensor train decompositions for quantum dynamics simulations abstract
Abstract:
We introduce the “tensor-train split-operator Fourier transform” (TT-SOFT) algorithm for simulations of multidimensional nonadiabatic quantum dynamics [J. Chem. Theory Comput. 13: 4034-4042 (2017)]. TT-SOFT is essentially the grid-based SOFT method implemented in dynamically adaptive tensor-train representations. In the same spirit of all matrix product states, the tensor-train format enables the representation, propagation, and computation of observables of multidimensional wave functions in terms of the grid-based wavepacket tensor components, bypassing the need of actually computing the wave function in its full-rank tensor product grid space. We demonstrate the accuracy and efficiency of the TT-SOFT method as applied to propagation of 24-dimensional wave packets, describing the S1/S2 interconversion dynamics of pyrazine after UV photoexcitation to the S2 state. Our results show that the TT-SOFT method is a powerful computational approach for simulations of quantum dynamics of polyatomic systems since it avoids the exponential scaling problem of full-rank grid-based representations. The development of ultrafast laser technology has also opened the possibility to control ultrafast reaction dynamics in excited electronic states. Thus, we report a Floquet theoretical study of quantum control of the ultrafast cis-trans photoisomerization dynamics of rhodopsin [J. Chem. Theory Comput. 14(3): 1198-1205 (2018)]. The predicted light-induced potentials, including light-induced conical intersections, can open new reaction channels or modify the product yields of existing pathways. The nonadiabatic dynamics is described by a 3-state 2-dimensional wave-packet, coupled to a bath of 23 vibrational modes, evolving according to an empirical model Hamiltonian with frequencies and excited-state gradients parameterized to reproduce the observed resonance Raman excitations of rhodopsin. We analyze the effect of different control pulses on the photoisomerization dynamics, including changes in pulse duration and intensity. We interpret the results in terms of \'dressed states\' and we exploit the Floquet description where the effect of control pulses is naturally decoupled along the different channels. Results obtained with 300 fs-long pulses suggest that it should be possible to delay the excited-state isomerization for hundreds of femtoseconds. Our findings are thus particularly relevant to the development of ultrafast optical switches based on visual pigments.
Onlline Seminar
Prof. Dr. Kristin Lauter (Microsoft Research)
eSeminar: Supersingular Isogeny Graphs in Cryptography abstract
Abstract:
(**This eSeminar will take place on Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact karan.khathuria@math.uzh.ch **)
As we move towards a world which includes quantum computers which exist at scale, we are forced to consider the question of what hard problems in mathematics our next generation of cryptographic systems will be based on. Supersingular Isogeny Graphs were proposed for use in cryptography in 2006 by Charles, Goren, and Lauter. Supersingular Isogeny Graphs are examples of Ramanujan graphs, which are optimal expander graphs. These graphs have the property that relatively short walks on the graph approximates the uniform distribution, and for this reason, walks on expander graphs are often used as a good source of randomness in computer science. But the reason these graphs are important for cryptography is that finding paths in these graphs, i.e. routing, is hard: there are no known subexponential algorithms to solve this problem, either classically or on a quantum computer. For this reason, cryptosystems based on the hardness of problems on Supersingular Isogeny Graphs are currently under consideration for standardization in the NIST Post-Quantum Cryptography (PQC) Competition. This talk will introduce these graphs, the cryptographic applications, and the various algorithmic approaches which have been tried to attack these systems.
20:00 • Onlline Seminar
Prof. Dr. Emmanuel Candès (Stanford University, Stanford, USA)
Reliable predictions? Equitable treatment? Some recent progress in predictive inference abstract
Abstract:
Recent progress in machine learning (ML) provides us with many potentially effective tools to learn from datasets of ever increasing sizes and make useful predictions. How do we know that these tools can be trusted in critical and high-sensitivity systems? If a learning algorithm predicts the GPA of a prospective college applicant, what guarantees do I have concerning the accuracy of this prediction? How do we know that it is not biased against certain groups of applicants? This talk introduces statistical ideas to ensure that the learned models satisfy some crucial properties, especially reliability and fairness (in the sense that the models need to apply to individuals in an equitable manner). To achieve these important objectives, we shall not ‘open up the black box’ and try understanding its underpinnings. Rather we discuss broad methodologies — conformal inference, quantile regression, the Jackknife+ — that can be wrapped around any black box as to produce results that can be trusted and are equitable.