Fetching the paper…
Reading the bibliography…
Markov chain methods are remarkably successful in computational physics, machine learning, and combinatorial optimization.
Bellman, R., A Markovian decision process . Journal of Mathematics and Mechanics 6(5)
1957
Earlier work this paper cites.
Hastings, W. K., Monte Carlo sampling methods using Markov chains and their applications . Biometrika 57(1)
1970
Earlier work this paper cites.
Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P., Optimization by simulated annealing . Science 220(4598)
1983
Earlier work this paper cites.
Geman, S. and Geman, D., Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images . Readings in Computer Vision, 564–584 (1987)
1987
Earlier work this paper cites.
Van Laarhoven, P. J., and Aarts, E. H., Simulated annealing . Simulated annealing: Theory and applications 37
1987
Earlier work this paper cites.
Sinclair, A., Algorithms for random generation and counting: a Markov chain approach . Springer (1993)
1993
Earlier work this paper cites.
Gilks, W. R., Richardson, S. and Spiegelhalter, D. Markov chain Monte Carlo in practice . CRC press (1995)
1995
Earlier work this paper cites.
Aldous, D., László, L. and Winkler, P., Mixing times for uniformly ergodic Markov chains . Stochastic Processes and their Applications 71(2)
1995
Earlier work this paper cites.
Kitaev, A. Y., Quantum measurements and the Abelian Stabilizer Problem . arXiv preprint quant-ph/9511026 (1995)
1995
Earlier work this paper cites.
Grover, L. K., A fast quantum mechanical algorithm for database search . Proceedings of the 28th annual ACM Symposium on the Theory of Computing, 212–219 (1996) [ arXiv:9605043 ]
1996
Earlier work this paper cites.
Norris, J. R., Markov chains . Cambridge University Press (1998)
1998
Earlier work this paper cites.
Sutton, R. S. & Barto, A. G. Reinforcement learning: An introduction . MIT Press, Cambridge Massachusetts (1998)
1998
Earlier work this paper cites.
Boyer, M., Brassard, G., Høyer, P. and Tapp, A., Tight bounds on quantum searching . 3.0.CO;2-P" title="" class="ltx_ref ltx_href">Progress of Physics 46(4-5)
1998
Earlier work this paper cites.
Newman, M. E. J. and Barkema, G. T., Monte Carlo Methods in Statistical Physics . Oxford University Press (1999)
1999
Earlier work this paper cites.
Martinelli, F., Lectures on Glauber dynamics for discrete spin models . Lectures on probability theory and statistics, Springer, 93–191 (1999)
1999
Earlier work this paper cites.
Nayak, A. and Vishwanath, A., Quantum walk on the line . arXiv:quant-ph/0010117 (2000)
2000
Earlier work this paper cites.
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A. and Watrous, J., One-dimensional quantum walks . Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 37–49 (2001)
2001
Earlier work this paper cites.
Aharonov, D., Ambainis, A., Kempe, J. and Vazirani, U., Quantum walks on graphs . Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 50–59 (2001) [ arXiv:0012090 ]
2001
Earlier work this paper cites.
Brassard, G., Hoyer, P., Mosca, M. and Tapp, A., Quantum Amplitude Amplification and Estimation . Contemporary Mathematics 305
2002
Cited alongside, same era.
Grover, L. and Rudolph, T., Creating superpositions that correspond to efficiently integrable probability distributions . arXiv preprint quant-ph/0208112 (2002)
2002
Cited alongside, same era.
Kempe, J., Quantum random walks - an introductory overview . Contemp. Phys. 44(4)
2003
Cited alongside, same era.
Aharonov, D. and Ta-Shma, A., Adiabatic Quantum State Generation and Statistical Zero Knowledge . Proceedings of the 35th annual ACM symposium on Theory of computing, 20–29 (2003) [ arXiv:0301023 ]
2003
Cited alongside, same era.
Childs, A., Quantum information processing in continuous time . Ph. D. Thesis, Massachusetts Institute of Technology (2004)
2004
Cited alongside, same era.
Magniez, F., Nayak, A., Roland, J. and Santha, M., Search via quantum walk . SIAM Journal on Computing 40(1)
2011
Later among the works it cites.
2011
Later among the works it cites.
2012
Later among the works it cites.
Briegel, H. J. and De las Cuevas, G., Projective simulation for artificial intelligence . Sci. Rep. 2
2012
Later among the works it cites.
Fischer, A. and Christian, I., An introduction to restricted Boltzmann machines . Iberoamerican Congress on Pattern Recognition, 14–36 (2012)
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Szegedy, M., Quantum speed-up of Markov chain based algorithms . 45th Annual IEEE Symposium on Foundations of Computer Science, 32–41(2004)
2004
Cited alongside, same era.
Ambainis, A., Quantum walk algorithms for element distinctness . SIAM Journal on Computing 37(1)
2004
Cited alongside, same era.
Grover, L. K., Fixed-Point Quantum Search . Phys. Rev. Lett. 95
2005
Cited alongside, same era.
Richter, P. C., Quantum speedup of classical mixing processes . Phys. Rev. A 76
2007
Cited alongside, same era.
Richter, P. C., Almost uniform sampling via quantum walks . New J. Phys. 9(72)
2007
Cited alongside, same era.
Magniez, F., Santha, M. and Szegedy, M., Quantum Algorithms for the Triangle Problem . SIAM Journal on Computing 37(2)
2007
Cited alongside, same era.
2008
Cited alongside, same era.
Later among the works it cites.
Aaronson, S. and Christiano, P., Quantum Money from Hidden Subspaces . Theory of Computing 9(9)
2013
Later among the works it cites.
2014
Later among the works it cites.
Yoder, T. J., Low, G. H. and Chuang, I. L., Fixed-Point Quantum Search with an Optimal Number of Queries . Phys. Rev. Lett. 113
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Closest in time.
2015
Closest in time.
Montanaro, A., Quantum speedup of Monte Carlo methods . Proceedings of the Royal Society A 471(2181)
2015
Closest in time.
Bishop, C. M., Pattern recognition and machine learning . Springer-Verlag, New York (2016)
2016
Closest in time.
Wiebe, N. and Granade, C. E., Efficient Bayesian Phase Estimation Phys. Rev. Lett. 117
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
Levin, D. A. and Peres, Y., Markov chains and mixing times . American Mathematical Soc. (2017)
2017
Closest in time.