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

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.