This talk posits a new quantum framework for designing and analyzing communication-efficient distributed quantum algorithms. Using this framework, we present distributed quantum algorithms for two fundamental problems in distributed computing, namely, leader election and agreement. Our quantum algorithms are significantly more message-efficient compared to their classical counterparts and breach the classical lower bounds. Joint work with Fabien Dufoulon (Lancaster University) and Frédéric Magniez (Université Paris Cité, CNRS, IRIF).
Gopal Pandurangan is a Moores Professor of Computer Science at the University of Houston, USA. His research interests include the theory and algorithms for distributed computing, networks, quantum computing, machine learning, and big data, and he has over 150 refereed publications. He is a Fellow of the Institute of Electrical and Electronics Engineers (IEEE), a recipient of the University of Houston Research Excellence Award, and a winner of the ACM PODC 2025 Best Paper Award.