3 citations · 3 across the 4 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Translation-Invariant Quantum Algorithms for Ordered Search are Optimal
Joseph Carolan, Andrew M. Childs, Matt Kovacs-Deak +1
Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses $\lceil \log_{2}{n}\…
quant-ph2022★ 3 cited
Quantum divide and conquer
Andrew M. Childs, Robin Kothari, Matt Kovacs-Deak +2
The divide-and-conquer framework, used extensively in classical algorithm design, recursively breaks a problem of size into smaller subproblems (say, copies of size e…