247 citations · 830 across the 24 of their papers we have counts for
27 papers
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms
Michael Czekanski, Shelby Kimmel, R. Teal Witter
The general adversary dual is a powerful tool in quantum computing because it gives a query-optimal bounded-error quantum algorithm for deciding any Boolean function. Unfortunately…
Quantum Algorithm for Path-Edge Sampling
Stacey Jeffery, Shelby Kimmel, Alvaro Piedrafita
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undirected graph given as an adjacency matrix, and show that this can be done in query…
Improved Quantum Query Complexity on Easier Inputs
Noel T. Anderson, Jay-U Chung, Shelby Kimmel +2
Quantum span program algorithms for function evaluation sometimes have reduced query complexity when promised that the input has a certain structure. We design a modified span prog…
Leveraging Unknown Structure in Quantum Query Algorithms
Noel T. Anderson, Jay-U Chung, Shelby Kimmel
Quantum span program algorithms for function evaluation commonly have reduced query complexity when promised that the input has a certain structure. We design a modified span progr…
Consistency testing for robust phase estimation
Antonio E. Russo, William M. Kirby, Kenneth M. Rudinger +2
We present an extension to the robust phase estimation protocol, which can identify incorrect results that would otherwise lie outside the expected statistical range. Robust phase…
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs
Shelby Kimmel, R. Teal Witter
We design quantum algorithms for maximum matching. Working in the query model, in both adjacency matrix and adjacency list settings, we improve on the best known algorithms for gen…