Speaker
Arinta Auza
Description
We study the query complexity of determining if a graph is connected with global queries. By following the template of l0-samplers, we construct quantum algorithms solving graph connectivity in several global query models.
Authors
Arinta Auza
Troy Lee
(University of Technology Sydney)