167 citations · 643 across the 22 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2014★ 4 cited
Quantum algorithms for shortest paths problems in structured instances
Aran Nayebi, Virginia Vassilevska Williams
We consider the quantum time complexity of the all pairs shortest paths (APSP) problem and some of its variants. The trivial classical algorithm for APSP and most all pairs path pr…
quant-ph2014
Quantum lower bound for inverting a permutation with advice
Aran Nayebi, Scott Aaronson, Aleksandrs Belovs +1
Given a random permutation as a black box and , we want to output . Supplementary to our input, we are given classical advice in the form…