Oxford University Club Cricket Club (OUCCC) is a friendly and inclusive cricket club for Oxford University staff, graduate students, and alumni, and we’d love to welcome new players this season. We play relaxed 40-over fixtures almost every Sunday from April to September, take a break in July for our popular mini T20 World Cup, and run weekly outdoor nets from February onwards (weather permitting). Players of all abilities are very welcome.

Calving laws and where to find them
Benn, D Wheel, I Åström, J Christoffersen, P Cook, S Luckman, A Nick, F Hulton, N Hewitt, I Bassis, J Journal of Glaciology (01 Jan 2026)
Wed, 04 Mar 2026
12:45
TCC VC

Krylov complexity and the universal operator growth hypothesis

Om Gupta
Abstract

A central goal in the study of quantum chaos is being able to make universal statements about the dynamics of generic Hamiltonian systems. Under time evolution, an initially local operator progressively explores the Hilbert space of a system becoming increasingly non-local in the process. We will see that this idea lends itself to a natural notion of operator complexity measured (in the Hilbert space of operators) by the overlap of a time-evolving operator with a basis naturally adapted to time evolution and stratified by the growth in the operator's support. The information contained in this so-called Krylov basis is encoded in a sequence called the Lanczos coefficients which quantify the rate at which an operator is "pushed" along the Krylov basis to successively more complex elements. The universal operator growth hypothesis is then the conjecture that the Lanczos coefficients grow asymptotically linearly in any quantum chaotic system. In this talk, I will present an overview of these ideas and see how they manifest in the example of the well-studied SYK model. This talk is primarily based on 1812.08657.

Accelerating Inference for Multilayer Neural Networks with Quantum Computers
Rattew, A Huang, P Guo, N Pira, L Rebentrost, P The Fourteenth International Conference on Learning Representations
Visual description of the concept
Quantum computers achieve a remarkable exponential speedup in integer factorisation (potentially making widely deployed cryptographic schemes vulnerable). Beyond that large-scale applications remain comparatively scarce, and if a fully error-corrected quantum computer were available it is not clear what 'killer app' it would be used for.
Mon, 15 Jun 2026

15:30 - 16:30
L3

TBA

Emilio Ferrucci
(SISSA)
Abstract

TBA

Mon, 27 Apr 2026

15:30 - 16:30
L3

TBA

Prof. Zhen-Qing Chen
(University of Washington)
Abstract

TBA

Wed, 25 Mar 2026

11:00 - 13:00
L4

Large-N Methods and Renormalisation Group

Leonard Ferdinand
(Max Planck Institute for Mathematics in the Sciences )
Abstract

I will review how the large N expansion can be used in the context of the renormalisation group to probe some strongly coupled regimes. In particular, I will discuss a work by Gawedzki and Kupiainen where the authors study the three-dimensional non-Gaussian infrared fixed point of Phi^4 in the case of a hierarchical model of rank-one covariance, and explain how their approach could generalise to more realistic models. 

This is a joint work with Ajay Chandra.  

Subscribe to