# Quantum Walk Sampling by Growing Seed Sets

@inproceedings{Apers2019QuantumWS,
title={Quantum Walk Sampling by Growing Seed Sets},
author={Simon Apers},
booktitle={ESA},
year={2019}
}
• Simon Apers
• Published in ESA 2019
• Computer Science, Mathematics, Physics
• 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 requires a number of quantum walk steps scaling as $\widetilde{O}(m^{1/3} \delta^{-1/3})$, with $m$ the number of edges and $\delta$ the random walk spectral gap. This improves on existing strategies by initially growing a classical seed set in the graph, from which a quantum walk is then run. The algorithm leads to a… CONTINUE READING

## Expansion Testing using Quantum Fast-Forwarding and Seed Sets

• Simon Apers
• Mathematics, Physics, Computer Science
• ArXiv
• 2019

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 39 REFERENCES

## Quantum Algorithms for Connectivity and Related Problems

• Computer Science, Mathematics, Physics
• ESA
• 2018

## Quantum Fast-Forwarding Markov Chains

• Mathematics
• 2018

## Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness

• Mathematics, Computer Science, Physics
• Quantum Inf. Comput.
• 2018

## Quantum Recommendation Systems

• Computer Science, Mathematics, Physics
• ITCS
• 2017

## Quantum SDP-Solvers: Better Upper and Lower Bounds

• Computer Science
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017

## On Sampling Nodes in a Network

• Computer Science
• WWW
• 2016

## Quantum Walks Can Find a Marked Element on Any Graph

• Mathematics, Physics, Computer Science
• Algorithmica
• 2015