Warsaw Quantum Computing Group

We invite you to attend (online) Episode LXI
of Warsaw Quantum Computing Group meetups!

"Graphs, quantum algorithms and fine-grained complexity"

Adam Wesołowski

7.11.2024, 18:00 UTC+1

Video recording

Abstract:

In this talk, we will explore the landscape of quantum algorithm design, breaking down key concepts and techniques that distinguish quantum computing from classical methods. Starting with foundational quantum algorithmic primitives, we will examine well-known examples, such as quantum search algorithms and their variants. Additionally, we will discuss applications to various graph problems, including the Traveling Salesman Problem (TSP), vertex eccentricity, graph radius, cycle finding, shortest cycle finding, and more. Beyond these tools, we will delve into more advanced topics, such as quantum query lower bounds and the limits of what quantum algorithms can efficiently achieve.

BIO:
Adam Wesołowski is a PhD candidate at Royal Holloway, University of London, where he focuses on quantum algorithms, particularly for solving graph problems and developing quantum fine-grained reductions. He holds a BSc in Theoretical Physics from Lancaster University, where he graduated with first-class honours, earning him direct admission into the PhD programme. Adam has presented his research at several conferences, notably on quantum algorithms for graph-related problems such as shortest path-finding. He is also involved with the quantum computing start-up QunaSys, where he collaborates with an international team to advance Quantum Machine Learning techniques, particularly in quantum chemistry applications.

The meeting is organized by the Quantum AI Foundation and QPoland.