
Testing properties of signed graphs
In graph property testing the task is to distinguish whether a graph sat...
read it

Quantum query complexity of edge connectivity
The edge connectivity of a simple graph is the least number of edges who...
read it

A Unified Framework of Quantum Walk Search
The main results on quantum walk search are scattered over different, in...
read it

Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
Graph sparsification underlies a large number of algorithms, ranging fro...
read it

Expansion Testing using Quantum FastForwarding and Seed Sets
Expansion testing aims to decide whether an nnode graph has expansion a...
read it

Quantum Walk Sampling by Growing Seed Sets
This work describes a new algorithm for creating a superposition over th...
read it

Bounding the convergence time of local probabilistic evolution
Isoperimetric inequalities form a very intuitive yet powerful characteri...
read it
Simon Apers
is this you? claim profile