9 citations · 22 across the 7 of their papers we have counts for
5 papers · 1 filter
Quantum complexity of minimum cut
Simon Apers, Troy Lee
The minimum cut problem in an undirected and weighted graph is to find the minimum total weight of a set of edges whose removal disconnects . We completely characterize the…
A Unified Framework of Quantum Walk Search
Simon Apers, András Gilyén, Stacey Jeffery
The main results on quantum walk search are scattered over different, incomparable frameworks, most notably the hitting time framework, originally by Szegedy, the electric network…
Expansion Testing using Quantum Fast-Forwarding and Seed Sets
Simon Apers
Expansion testing aims to decide whether an -node graph has expansion at least , or is far from any such graph. We propose a quantum expansion tester with complexity $\wideti…
Quantum Walk Sampling by Growing Seed Sets
Simon Apers
This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm r…
Quantum Fast-Forwarding: Markov Chains and Graph Property Testing
Simon Apers, Alain Sarlette
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain.…