Date: October 21, 2024
Time: 9.20am – 3.20pm
Location: Rhodes 380
Schedule
| Time | Title | Speaker |
| 9.20am – 9.50am | An invitation to the sample complexity of quantum hypothesis testing | Theshani Nuradha |
| 9.55am – 10.25am | Extendibility limits quantum-secured communication and key distillation | Vishal Singh |
| 10.25am – 10.40am | Break | |
| 10.40am – 11.10am | Limit theorems for Gromov-Wasserstein distances with applications to testing graph symmetries | Gabriel Rioux |
| 11.15am – 11.45am | Sample complexity of distinguishing cause from effect | Saravanan Kandasamy |
| 11.45am – 1.30pm | Lunch Break | |
| 1.30pm – 2.00pm | Improved channel coding performance through cost variability | Adeel Mahmood |
| 2.05pm – 2.35pm | Adaptive quantum state inference: unified lower bound from measurement information channel | Abhilash Dharmavarapu |
| 2.35pm – 2.50pm | Break | |
| 2.50 pm – 3.20pm | New paradigm in optimal transport: calculus and Riemannian structure of Gromov-Wasserstein distance | Zhengxin Zhang |