10 citations · 12 across the 2 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2022
Quantum speedups for treewidth
Vladislavs Kļevickis, Krišjānis Prūsis, Jevgēnijs Vihrovs
In this paper, we study quantum algorithms for computing the exact value of the treewidth of a graph. Our algorithms are based on the classical algorithm by Fomin and Villanger (Co…
quant-ph2018
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
Andris Ambainis, Kaspars Balodis, Jānis Iraids +3
In this paper we study quantum algorithms for NP-complete problems whose best classical algorithm is an exponential time application of dynamic programming. We introduce the path i…