References
[ACL06] Reid Andersen, Fan R.K. Chung, and Kevin Lang. Local graph partition-
ing using PageRank vectors. In Proceedings of the 47th IEEE Symposium on
Foundations of Computer Science (FOCS), pages 475–486. IEEE, 2006. doi:
10.1109/FOCS.2006.44
[ACL11] Andris Ambainis, Andrew M. Childs, and Yi-Kai Liu. Quantum property test-
ing for bounded-degree graphs. In Approximation, Randomization, and Com-
binatorial Optimization. Algorithms and Techniques, pages 365–376. Springer,
2011. doi: 10.1007/978-3-642-22935-0_31
[AGJK20] Andris Ambainis, András Gilyén, Stacey Jeffery, and Martins Kokainis.
Quadratic speedup for finding marked vertices by quantum walks. In Pro-
ceedings of the 52nd ACM Symposium on Theory of Computing (STOC), pages
412–424. ACM, 2020. doi: 10.1145/3357713.3384252
[AGPT16] Reid Andersen, Shayan Oveis Gharan, Yuval Peres, and Luca Trevisan. Al-
most optimal local graph clustering using evolving sets. Journal of the ACM,
63(2):15, 2016. doi: 10.1145/2856030
[Amb07] Andris Ambainis. Quantum walk algorithm for element distinctness.
SIAM Journal on Computing, 37(1):210–239, 2007. doi: 10.1137/
S0097539705447311
[AP09] Reid Andersen and Yuval Peres. Finding sparse cuts locally using evolving sets.
In Proceedings of the 41st ACM Symposium on Theory of Computing (STOC),
pages 235–244. ACM, 2009. doi: 10.1145/1536414.1536449
[A19] Simon Apers. Quantum walk sampling by growing seed sets. In Proceedings
of the 27th European Symposium on Algorithms (ESA), volume 144 of Leibniz
International Proceedings in Informatics (LIPIcs), pages 9:1–9:12. Springer,
2019. doi: 10.4230/LIPIcs.ESA.2019.9
[AS19] Simon Apers and Alain Sarlette. Quantum fast-forwarding Markov chains and
property testing. Quantum Information and Computation, 19(3&4):181–213,
2019. doi: 10.5555/3370245.3370246.
[CKK
+
18] Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, and
Yuval Peres. Testing graph clusterability: Algorithms and lower bounds. In
Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer
Science. IEEE, 2018. doi: 10.1109/FOCS.2018.00054
[CPS15] Artur Czumaj, Pan Peng, and Christian Sohler. Testing cluster structure of
graphs. In Proceedings of the 47th ACM Symposium on Theory of Computing
(STOC), pages 723–732. ACM, 2015. doi: 10.1145/2746539.2746618
[CS10] Artur Czumaj and Christian Sohler. Testing expansion in bounded-degree
graphs. Combinatorics, Probability and Computing, 19(5-6):693–709, 2010. doi:
10.1017/S096354831000012X
[GR02] Oded Goldreich and Dana Ron. Property testing in bounded degree graphs.
Algorithmica, 32(2):302–343, 2002. doi: 10.1007/s00453-001-0078-7
[GR11] Oded Goldreich and Dana Ron. On testing expansion in bounded-degree
graphs. In Studies in Complexity and Cryptography. Miscellanea on the In-
terplay between Randomness and Computation, pages 68–75. Springer, 2011.
doi: 10.1007/978-3-642-22670-0_9
Accepted in Quantum 2020-09-10, click title to verify. Published under CC-BY 4.0. 15