Showing 2026Show all
2 papers · 1 filter
cs.DC2026
No Distributed Quantum Advantage for 3-Coloring Rooted Trees and 2-Coloring Even Cycles
Pierre Fraigniaud, Frédéric Magniez, Isabella Ziccardi
Significant effort has been devoted over the past decade to understanding whether quantum resources can provide advantages in distributed computing, and in particular whether they…
quant-ph2026
Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
Fabien Dufoulon, Frédéric Magniez, Gopal Pandurangan
We present new distributed quantum algorithms for fundamental distributed computing problems, namely, leader election, broadcast, Minimum Spanning Tree (MST), and Breadth-First Sea…