Fetching the paper…
Reading the bibliography…
Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning.
E. Ising, Beitrag zur Theorie des Ferromagnetismus, Z. Phys 31
1925
Earlier work this paper cites.
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of state calculations by fast computing machines, J. Comp. Phys. 21
1953
Earlier work this paper cites.
W. K. Hastings, Monte Carlo sampling methods using Markov chains and their applications, Biometrika 57
1970
Earlier work this paper cites.
D. Sherrington and S. Kirkpatrick, Solvable model of a spin-glass, Phys. Rev. Lett 35
1975
Earlier work this paper cites.
F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A 15
1982
Earlier work this paper cites.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science 220
1983
Earlier work this paper cites.
D. H. Ackley, G. E. Hinton, and T. J. Sejnowski, A learning algorithm for Boltzmann machines, Cogn. Sci 9
1985
Earlier work this paper cites.
M. Suzuki, Decomposition formulas of exponential operators and Lie exponentials with some applications to quantum mechanics and statistical physics, J. Math. Phys 26
1985
Earlier work this paper cites.
R. H. Swendsen and J.-S. Wang, Replica Monte Carlo simulation of spin-glasses, Phys. Rev. Lett 57
1986
Earlier work this paper cites.
R. H. Swendsen and J.-S. Wang, Nonuniversal critical dynamics in Monte Carlo simulations, Phys. Rev. Lett 58
1987
Earlier work this paper cites.
U. Wolff, Collective Monte Carlo updating for spin systems, Phys. Rev. Lett 62
1989
Earlier work this paper cites.
S. Lloyd, Universal quantum simulators, Science 273
1996
Earlier work this paper cites.
J. Dongarra and F. Sullivan, Guest editors’ introduction to the top 10 algorithms, Comput. Sci. Eng 2
2000
Earlier work this paper cites.
J. Houdayer, A cluster Monte Carlo algorithm for 2-dimensional spin glasses, Eur. Phys. J. B 22
2001
Earlier work this paper cites.
C. Andrieu, N. De Freitas, A. Doucet, and M. I. Jordan, An introduction to MCMC for machine learning, Mach. Learn 50
2003
Earlier work this paper cites.
M. Szegedy, Quantum speed-up of Markov chain based algorithms, in 45th Annual IEEE Symposium on Foundations of Computer Science (2004) pp. 32–41
2004
Cited alongside, same era.
P. C. Richter, Quantum speedup of classical mixing processes, Phys. Rev. A 76
2007
Cited alongside, same era.
K. Huang, Statistical mechanics (John Wiley & Sons, 2008)
2008
Cited alongside, same era.
R. D. Somma, S. Boixo, H. Barnum, and E. Knill, Quantum simulations of classical annealing processes, Phys. Rev. Lett. 101
2008
Cited alongside, same era.
P. Wocjan and A. Abeyesinghe, Speedup via quantum sampling, Phys. Rev. A 78
2008
Cited alongside, same era.
V. Ambegaokar and M. Troyer, Estimating errors reliably in Monte Carlo simulations of the Ehrenfest model, Am. J. Phys 78
2019
Later among the works it cites.
J. E. Moussa, Measurement-based quantum Metropolis algorithm, arXiv:1903.01451 (2019)
2019
Later among the works it cites.
V. N. Smelyanskiy, K. Kechedzhi, S. Boixo, S. V. Isakov, H. Neven, and B. Altshuler, Nonergodic delocalized states for efficient population transfer within a narrow band of the energy landscape, Phys. Rev. X 10
2020
Later among the works it cites.
A. W. Harrow and A. Y. Wei, Adaptive quantum simulated annealing for Bayesian inference and estimating partition functions, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2020) pp. 193–212
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
K. Temme, T. J. Osborne, K. G. Vollbrecht, D. Poulin, and F. Verstraete, Quantum Metropolis sampling, Nature 471
2011
Cited alongside, same era.
M.-H. Yung and A. Aspuru-Guzik, A quantum–quantum Metropolis algorithm, Proc. Natl. Acad. Sci 109
2012
Cited alongside, same era.
A. Lucas, Ising formulations of many NP problems, Front. Phys 2
2014
Cited alongside, same era.
Z. Zhu, A. J. Ochoa, and H. G. Katzgraber, Efficient cluster algorithm for spin glasses in any space dimension, Phys. Rev. Lett 115
2015
Cited alongside, same era.
I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning (MIT Press, 2016)
2016
Cited alongside, same era.
J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Phys. Rev. A 94
2016
Cited alongside, same era.
J. Lemieux, B. Heim, D. Poulin, K. Svore, and M. Troyer, Efficient quantum walk circuits for Metropolis-Hastings algorithm, Quantum 4
2020
Later among the works it cites.
Y. Wu et al. , Strong quantum computational advantage using a superconducting quantum processor, Phys. Rev. Lett 127
2021
Later among the works it cites.
H.-S. Zhong et al. , Phase-programmable Gaussian boson sampling using stimulated squeezed light, Phys. Rev. Lett 127
2021
Later among the works it cites.
2021
Later among the works it cites.
S. Arunachalam, V. Havlicek, G. Nannicini, K. Temme, and P. Wocjan, Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions, in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, 2021) pp. 112–122
2021
Later among the works it cites.
M. Anis Sajid et al. , Qiskit: An open-source framework for quantum computing (2021)
2021
Later among the works it cites.
N. Earnest, C. Tornow, and D. J. Egger, Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware, Phys. Rev. Research 3
2021
Later among the works it cites.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, et al. , Variational quantum algorithms, Nat. Rev. Phys 3
2021
Later among the works it cites.
G. Mazzola, Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers, Phys. Rev. A 104
2021
Later among the works it cites.
R. Babbush, J. R. McClean, M. Newman, C. Gidney, S. Boixo, and H. Neven, Focus beyond quadratic speedups for error-corrected quantum advantage, PRX Quantum 2
2021
Later among the works it cites.