Fetching the paper…
Reading the bibliography…
We investigate quantum backtracking algorithms of a type previously introduced by Montanaro (arXiv:1509.02374).
Probability inequalities for sums of bounded random variables
Hoeffding · 1963
Earlier work this paper cites.
Quantum amplitude amplification and estimation
Brassard · 2002
Earlier work this paper cites.
Quantum random-walk search algorithm
Shenvi · 2003
Earlier work this paper cites.
Quantum speed-up of Markov chain based algorithms
Szegedy · 2004
Earlier work this paper cites.
Quantum query complexity of state conversion
Lee · 2011
Earlier work this paper cites.
Search via quantum walk
Magniez · 2011
Cited alongside, same era.
Quantum walks and electric networks
Belovs · 2013
Cited alongside, same era.
Time-efficient quantum walks for 3-distinctness
Belovs · 2013
Cited alongside, same era.
Ito · 2015
Cited alongside, same era.
Quantum walk speedup of backtracking algorithms
Montanaro · 2015
Cited alongside, same era.
Bound on queries to a tree with unusual probabilties – follow-up
Jarret
Cited in the paper.
Quantum walks can find a marked element on any graph
Krovi · 2016
Later among the works it cites.
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
Ambainis · 2017
Closest in time.
Quantum Algorithms for Graph Connectivity and Formula Evaluation
Jeffery · 2017
Closest in time.
Efficient quantum algorithms for analyzing large sparse electrical networks
Wang · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…