Fetching the paper…
Reading the bibliography…
In this paper we study quantum algorithms for NP-complete problems whose best classical algorithm is an exponential time application of dynamic programming.
“Dynamic Programming Treatment of the Travelling Salesman Problem”
Richard Bellman · 1962
Earlier work this paper cites.
“A Dynamic Programming Approach to Sequencing Problems”
Michael Held and Richard. Karp · 1962
Earlier work this paper cites.
“A Quantum Algorithm for Finding the Minimum”, 1996
Christoph Dürr and Peter Høyer · 1996
Earlier work this paper cites.
“A Fast Quantum Mechanical Algorithm for Database Search”
Lov. Grover · 1996
Earlier work this paper cites.
“Faster Exact Bandwidth”
Marek Cygan and Marcin Pilipczuk · 2008
Earlier work this paper cites.
“Quantum Random Access Memory”
Vittorio Giovannetti, Seth Lloyd and Lorenzo Maccone · 2008
Earlier work this paper cites.
“Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set”
Johan M.. van Rooij and Hans. Bodlaender · 2008
Cited alongside, same era.
“Quantum Search with Variable Times”
Andris Ambainis · 2010
Cited alongside, same era.
“Exact and Approximate Bandwidth”
Marek Cygan and Marcin Pilipczuk · 2010
Cited alongside, same era.
“Exact Exponential Algorithms”
Fedor. Fomin and Dieter Kratsch · 2010
Cited alongside, same era.
“A Note on Exact Algorithms for Vertex Ordering Problems on Graphs”
Hans. Bodlaender, Fedor. Fomin, Arie M. C.. Koster, Dieter Kratsch and Dimitrios. Thilikos · 2012
Cited alongside, same era.
“Determinant Sums for Undirected Hamiltonicity”
Andreas Bj“”orklund · 2014
Cited alongside, same era.
“Large Induced Subgraphs via Triangulations and CMSO”
F. Fomin, I. Todinca and Y. Villanger · 2015
Later among the works it cites.
“Quantum Walk Speedup of Backtracking Algorithms”, 2015
Ashley Montanaro · 2015
Later among the works it cites.
“Faster than Classical Quantum Algorithm for Dense Formulas of Exact Satisfiability and Occupation Problems”
Salvatore Mandrà, Gian Guerreschi and Alán Aspuru-Guzik · 2016
Later among the works it cites.
“Quantum Algorithm for Tree Size Estimation, with Applications to Backtracking and 2-player Games”
Andris Ambainis and Martins Kokainis · 2017
Later among the works it cites.
“Quantum Speedup of the Traveling Salesman Problem for Bounded-Degree Graphs”
Dominic. Moylett, Noah Linden and Ashley Montanaro · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…