3 papers
cs.DS2026
Distributed Quantum Algorithms Cannot Color Cycles with Probability 1
Xavier Coiteux-Roy, Maxime Flin, Carlos de Gois +3
We prove that any distributed quantum algorithm that finds a -coloring with probability in a cycle of anonymous identical computers has to be global, that is, it needs $Ω(n)…
quant-ph2026
Latent splitting as a causal probe
Santiago Zamora, Pedro Lauand, Isadora Veeren +2
Generalizations of Bell's framework to causal networks have yielded new foundational insights and applications, including the use of interventions to enhance the detection of noncl…
cs.DC2024
Distributed Quantum Advantage for Local Problems
Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy +10
We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prio…