Fetching the paper…
Reading the bibliography…
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF).
Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science. pp. 218–223. IEEE (1979)
1979
Earlier work this paper cites.
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing. pp. 406–415. ACM (1997)
1997
Earlier work this paper cites.
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. pp. 37–49. ACM (2001)
2001
Earlier work this paper cites.
Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. pp. 50–59. ACM (2001)
2001
Earlier work this paper cites.
Watrous, J.: Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences 62(2), 376–391 (2001)
2001
Earlier work this paper cites.
Nielsen, M.A., Chuang, I.: Quantum computation and quantum information. Cambridge University Press (2002)
2002
Earlier work this paper cites.
Brassard, G., Hœyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemporary Mathematics 305, 53–74 (2002)
2002
Earlier work this paper cites.
Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing. pp. 59–68. ACM (2003)
2003
Earlier work this paper cites.
Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing. pp. 20–29. ACM (2003)
2003
Earlier work this paper cites.
Ambainis, A.: Quantum walks and their algorithmic applications. International Journal of Quantum Information 1(04), 507–518 (2003)
2003
Earlier work this paper cites.
Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. pp. 32–41. IEEE (2004)
2004
Earlier work this paper cites.
Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the 36th Annual ACM symposium on Theory of Computing. pp. 81–90. ACM (2004)
2004
Earlier work this paper cites.
Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM Journal on Computing 37(1), 210–239 (2007)
2007
Earlier work this paper cites.
Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM Journal on Computing 37(2), 413–424 (2007)
2007
Earlier work this paper cites.
Richter, P.C.: Quantum speedup of classical mixing processes. Physical Review A 76(4), 042306 (2007)
2007
Earlier work this paper cites.
Gil, A., Segura, J., Temme, N.M.: Numerical methods for special functions, vol. 99. SIAM (2007)
2007
Earlier work this paper cites.
Somma, R.D., Boixo, S., Barnum, H., Knill, E.: Quantum simulations of classical annealing processes. Physical Review Letters 101(13), 130504 (2008)
2008
Earlier work this paper cites.
Wocjan, P., Abeyesinghe, A.: Speedup via quantum sampling. Physical Review A 78(4), 042336 (2008)
2008
Cited alongside, same era.
Santha, M.: Quantum walk based search algorithms. In: International Conference on Theory and Applications of Models of Computation. pp. 31–46. Springer (2008)
2008
Cited alongside, same era.
Verstraete, F., Murg, V., Cirac, I.J.: Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems. Advances in Physics 57(2), 143–224 (2008)
2008
Cited alongside, same era.
Poulin, D., Wocjan, P.: Sampling from the thermal quantum gibbs state and evaluating partition functions with a quantum computer. Physical Review Letters 103(22), 220502 (2009)
2009
Cited alongside, same era.
Andersen, R., Peres, Y.: Finding sparse cuts locally using evolving sets. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. pp. 235–244. ACM (2009)
Spielman, D.A., Teng, S.H.: A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM Journal on Computing 42(1), 1–26 (2013)
2013
Later among the works it cites.
Batu, T., Fortnow, L., Rubinfeld, R., Smith, W.D., White, P.: Testing closeness of discrete distributions. Journal of the ACM (JACM) 60(1), 4 (2013)
2013
Later among the works it cites.
Batson, J., Spielman, D.A., Srivastava, N., Teng, S.H.: Spectral sparsification of graphs: theory and algorithms. Communications of the ACM 56(8), 87–94 (2013)
2013
Later among the works it cites.
Sachdeva, S., Vishnoi, N.K., et al.: Faster algorithms via approximation theory. Foundations and Trends® in Theoretical Computer Science 9(2), 125–210 (2014)
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
Czumaj, A., Sohler, C.: Testing expansion in bounded-degree graphs. Combinatorics, Probability and Computing 19(5-6), 693–709 (2010)
2010
Cited alongside, same era.
Nachmias, A., Shapira, A.: Testing the expansion of a graph. Information and Computation 208(4), 309 (2010)
2010
Cited alongside, same era.
Childs, A.M.: On the relationship between continuous-and discrete-time quantum walk. Communications in Mathematical Physics 294(2), 581–603 (2010)
2010
Cited alongside, same era.
Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. In: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, pp. 68–75. Springer (2011)
2011
Cited alongside, same era.
Ambainis, A., Childs, A.M., Liu, Y.K.: Quantum property testing for bounded-degree graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 365–376. Springer (2011)
2011
Cited alongside, same era.
Valiant, P.: Testing symmetric properties of distributions. SIAM Journal on Computing 40(6), 1927–1968 (2011)
2011
Cited alongside, same era.
Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. SIAM Journal on Computing 40(1), 142–164 (2011)
2011
Cited alongside, same era.
2014
Later among the works it cites.
Gharan, S.O., Trevisan, L.: Partitioning into expanders. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1256–1266. SIAM (2014)
2014
Later among the works it cites.
2014
Later among the works it cites.
Berry, D.W., Childs, A.M., Cleve, R., Kothari, R., Somma, R.D.: Simulating hamiltonian dynamics with a truncated taylor series. Physical Review Letters 114(9), 090502 (2015)
2015
Later among the works it cites.
Czumaj, A., Peng, P., Sohler, C.: Testing cluster structure of graphs. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing. pp. 723–732. ACM (2015)
2015
Later among the works it cites.
Krovi, H., Magniez, F., Ozols, M., Roland, J.: Quantum walks can find a marked element on any graph. Algorithmica 74(2), 851–907 (2016)
2016
Later among the works it cites.
Montanaro, A., de Wolf, R.: A survey of quantum property testing. Theory of Computing Library Graduate Surveys (7), 1–81 (2016)
2016
Later among the works it cites.
Van Apeldoorn, J., Gilyén, A., Gribling, S., de Wolf, R.: Quantum SDP-solvers: better upper and lower bounds. In: Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science. pp. 403–414. IEEE (2017)
2017
Later among the works it cites.
Berry, D.W., Childs, A.M., Cleve, R., Kothari, R., Somma, R.D.: Exponential improvement in precision for simulating sparse hamiltonians. In: Forum of Mathematics, Sigma. vol. 5. Cambridge University Press (2017)
2017
Later among the works it cites.
Childs, A.M., Kothari, R., Somma, R.D.: Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM Journal on Computing 46(6), 1920–1950 (2017)
2017
Later among the works it cites.
2018
Closest in time.
Chiplunkar, A., Kapralov, M., Khanna, S., Mousavifar, A., Peres, Y.: Testing graph clusterability: Algorithms and lower bounds. In: Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science. IEEE (2018)
2018
Closest in time.