13 citations · 46 across the 17 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022★ 1 cited
Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model
François Le Gall, Ansis Rosmanis
We consider the LOCAL model of distributed computing, where in a single round of communication each node can send to each of its neighbors a message of an arbitrary size. It is kno…
quant-ph2022★ 3 cited
Hybrid Quantum-Classical Search Algorithms
Ansis Rosmanis
Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover's algorithm are optimal, and no faster quantu…