2 papers
cs.DS2020
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…
quant-ph2019
Applications of the quantum algorithm for st-connectivity
Kai DeLorenzo, Shelby Kimmel, R. Teal Witter
We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bi…