Measurement cost of metric-aware variational quantum algorithms
van Straaten, B Koczor, B (11 May 2020)
Fast computation of spherical phase-space functions of quantum many-body states
Koczor, B Zeier, R Glaser, S (14 Aug 2020)
Quantum Analytic Descent
Koczor, B Benjamin, S (31 Aug 2020)
Exponential Error Suppression for Near-Term Quantum Devices
Koczor, B (11 Nov 2020)
The Dominant Eigenvector of a Noisy Quantum State
Koczor, B (01 Apr 2021)
Fri, 03 Dec 2021
16:00
N4.01

G2 instantons in twisted M-theory

Jihwan Oh
(Oxford)
Further Information

It is also possible to join online via Zoom.

Abstract

Computing Donaldson-Thomas partition function of a G2 manifold has been a long standing problem. The key step for the problem is to understand the G2 instanton moduli space. I will discuss a string theory way to study the G2 instanton moduli space and explain how to compute the instanton partition function for a certain G2 manifold. An important insight comes from the twisted M-theory on the G2 manifold. This talk is based on a work with Michele del Zotto and Yehao Zhou.

Charge transport modelling of Lithium-ion batteries
RICHARDSON, G FOSTER, J RANOM, R PLEASE, C RAMOS, A European Journal of Applied Mathematics volume 33 issue 6 983-1031 (21 Dec 2022)
Tue, 30 Nov 2021
14:00
L6

The n-queens problem

Candy Bowtell
(Oxford/Birmingham)
Abstract

The $n$-queens problem asks how many ways there are to place $n$ queens on an $n \times n$ chessboard so that no two queens can attack one another, and the toroidal $n$-queens problem asks the same question where the board is considered on the surface of a torus. Let $Q(n)$ denote the number of $n$-queens configurations on the classical board and $T(n)$ the number of toroidal $n$-queens configurations. The toroidal problem was first studied in 1918 by Pólya who showed that $T(n)>0$ if and only if $n \equiv 1,5 \mod 6$. Much more recently Luria showed that $T(n)\leq ((1+o(1))ne^{-3})^n$ and conjectured equality when $n \equiv 1,5 \mod 6$. We prove this conjecture, prior to which no non-trivial lower bounds were known to hold for all (sufficiently large) $n \equiv 1,5 \mod 6$. We also show that $Q(n)\geq((1+o(1))ne^{-3})^n$ for all $n \in \mathbb{N}$ which was independently proved by Luria and Simkin and, combined with our toroidal result, completely settles a conjecture of Rivin, Vardi and Zimmerman regarding both $Q(n)$ and $T(n)$. 

In this talk we'll discuss our methods used to prove these results. A crucial element of this is translating the problem to one of counting matchings in a $4$-partite $4$-uniform hypergraph. Our strategy combines a random greedy algorithm to count `almost' configurations with a complex absorbing strategy that uses ideas from the methods of randomised algebraic construction and iterative absorption.

This is joint work with Peter Keevash.

Tue, 16 Nov 2021

16:00 - 17:00
C5

On C*-Rigidity for a Certain Class of Bieberbach Groups

Mat Antrobus, Dan Claydon, Jakub Curda, Jossy Russell
Abstract

Here we present the findings of our summer research project: an 8-week investigation of C*-Algebras. Our aim was to explore when a group is uniquely determined by its reduced group C*-algebra; i.e. when the group is C*-rigid. In particular, we applied techniques from topology, algebra, and analysis to prove C*-rigidity for a certain class of Bieberbach groups.

Subscribe to