In this talk, I will give a glimpse of an ongoing project on the development of quantum algorithms through composition of graphs. At a high level, the idea is to represent a quantum query algorithm as a graph. The graph composition framework, that this work introduces, then provides a black-box way to turn such graphs into quantum algorithms. It turns out that this framework is able to unify many existing frameworks that generate quantum query algorithms, and it provides tangible ways to make these implementations time-efficient too. If time permits, we will also take a look at several examples for which this framework can be used.

*We strongly encourage attendees to use their full name (and if possible, their UMD credentials) to join the zoom session.*