JSPS Visiting Fellow Professor Jingbo Wang from the University of Western Australia gives a series of lectures on Quantum Computation.

Lecture 6: Quantum Optimisation (practical applications)

JSPS Visiting Fellow Professor Jingbo Wang from the University of Western Australia gives a series of lectures on Quantum Computation.

Lecture 5: Grover's Search Algorithm (amplitude amplification) and Quantum Error Correction

JSPS Visiting Fellow Professor Jingbo Wang from the University of Western Australia gives a series of lectures on Quantum Computation.

Lecture 4: Shor’s Factorization Algorithm (quantum arithmetic and logic; quantum Fourier transformation)             

JSPS Visiting Fellow Professor Jingbo Wang from the University of Western Australia gives a series of lectures on Quantum Computation.

Lecture 3: Quantum Teleportation and Superdense Coding (demonstrating quantum advantages)

JSPS Visiting Fellow Professor Jingbo Wang from the University of Western Australia gives a series of lectures on Quantum Computation.

Lecture 2: Physical Implementation of Quantum Gates and Circuits (evolving the quantum computer governed by Schrödinger’s equation)

JSPS Visiting Fellow Professor Jingbo Wang from the University of Western Australia gives a series of lectures on Quantum Computation.

Lecture 1: Quantum Computing Fundamentals (postulates of quantum mechanics; quantum bits, gates, and circuits)

Speaker: Professor Asuka Takatsu, Tokyo Metropolitan University

Title: Curvature and Optimal transport

Abstract

In this series of lectures, I first review the notion of curvature (Gaussian curvature and Ricci curvature).
In particular, I recall some comparison theorems (Toponogov's triangle comparison theorem, Bishop--Gromov volume comparison theorem etc).
Then I introduce a generalized notion of curvature in non-smooth spaces.

Speaker: Professor Jun Kitagawa, Michigan State University

Title: A brief introduction to branched optimal transport

Abstract:

The optimal transport (also known as Monge-Kantorovich) problem is a classical optimization problem which has recently become the focus of much research with connections to various fields such as PDEs, geometry, and applications. In particular, it provides an effective way to metrize the space of probability measures on a given metric space. However, there is an alternate approach to metrizing such spaces using so called branched optimal transport. Branched optimal transport is based on the classical Gilbert-Steiner problem, later adapted by Qinglan Xia, and in contrast to the Monge-Kantorovich approach tends to yield branching structures. In this series of lectures I will introduce the basics of branched optimal transport and discuss some of the known results in the literature.

Statistical Mechanics, Critical Phenomena and Renorm

Speaker: Dr. Arang Rhie, Genome Informatics Section at NIH/NHGRI, USA
 

Zoom Link: https://oist.zoom.us/j/84967336568?pwd=ZkhVWlRCdzBjM3VDSWRneDVXaUhVUT09