31 citations · 47 across the 7 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022★ 2 cited
Quantum Algorithms for Community Detection and their Empirical Run-times
Chris Cade, Marten Folkertsma, Ido Niesen +1
We apply our recent work on empirical estimates of quantum speedups to the practical task of community detection in complex networks. We design several quantum variants of a popula…
quant-ph2022★ 4 cited
Quantifying Grover speed-ups beyond asymptotic analysis
Chris Cade, Marten Folkertsma, Ido Niesen +1
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms w…