My current interest is focused on the design of quantum algorithms, quantum agents, and quantum sequence models. My group looks at how to design quantum agents for executing agentic tasks and online games, and also to place upper bounds on how the resources required scale with parameters in the task.

We also enjoy working with quantum resource theory tool kits, and information theoretic bounds to quantify the complexity of certain tasks, and to invent benchmarks for quantum computers – certifying that if we can complete a certain task then it required certain quantum processing capabilities. Often this leads to new ways of seeing or designing quantum algorithms – in particular by looking at trade offs in pushing parts of the algorithm or cost to a classical computer and how this impacts overall resource costs.