9 citations · 22 across the 13 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
quant-ph2019★ 3 cited
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…
quant-ph2019
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…
quant-ph2019
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…