1 citations · 2 across the 13 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DC2023★ 1 cited
No distributed quantum advantage for approximate graph coloring
Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala +7
We give an almost complete characterization of the hardness of -coloring -chromatic graphs with distributed algorithms, for a wide range of models of distributed computing. I…
quant-ph2023★ 1 cited
Graph-theoretic insights on the constructability of complex entangled states
L. Sunil Chandran, Rishikesh Gajjala
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions w…