Quantum walk sampling by growing seed sets
From MaRDI portal
Recommendations
Cites work
- A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
- Adiabatic quantum state generation and statistical zero knowledge
- Finding sparse cuts locally using evolving sets
- Generating a random permutation with random transpositions
- Graph isomorphism in quasipolynomial time (extended abstract)
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On testing expansion in bounded-degree graphs
- Property testing in bounded degree graphs
- Quantum algorithms for connectivity and related problems
- Quantum property testing for bounded-degree graphs
- Quantum Query Complexity of Some Graph Problems
- Quantum recommendation systems
- Quantum simulations of classical random walks and undirected graph connectivity
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks can find a marked element on any graph
- Quantum walks on graphs
- Search via Quantum Walk
- Span programs and quantum algorithms for st-connectivity and claw detection
- Testing closeness of discrete distributions
- Testing cluster structure of graphs
This page was built for publication: Quantum walk sampling by growing seed sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075742)
