Fetching the paper…
Reading the bibliography…
Sampling from a Boltzmann distribution is NP-hard and so requires heuristic approaches.
Statistical analysis of non-lattice data
J. Besag · 1975
Earlier work this paper cites.
The Jackknife, the bootstrap and other resampling plans
B. Efron · 1980
Earlier work this paper cites.
Optimization by simulated annealing
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi · 1983
Earlier work this paper cites.
Bidirectional associative memories
K. Bart · 1988
Earlier work this paper cites.
Approximate counting, uniform generation and rapidly mixing markov chains
A. Sinclair and M. Jerrum · 1989
Earlier work this paper cites.
The computational complexity of probabilistic inference using Bayesian belief networks
G. F Cooper · 1990
Earlier work this paper cites.
Constrained monte carlo maximum likelihood for dependent data
C. J. Geyer and E. A. Thompson · 1992
Earlier work this paper cites.
Probabilistic inference using Markov chain Monte Carlo methods
R. M. Neal · 1993
Earlier work this paper cites.
Exchange monte carlo method and application to spin glass simulations
K. Hukushima and K. Nemoto · 1996
Earlier work this paper cites.
Quantum annealing in the transverse Ising model
T. Kadowaki and H. Nishimori · 1998
Earlier work this paper cites.
Theory of Point Estimation
E. L. Lehmann and G. Casella · 1998
Earlier work this paper cites.
Annealed importance sampling
R. M. Neal · 2001
Earlier work this paper cites.
Training products of experts by minimizing contrastive divergence
G. Hinton · 2002
Earlier work this paper cites.
Estimation of entropy and mutual information
L. Paninski · 2003
Earlier work this paper cites.
Entropy Estimates from Insufficient Samplings
P. Grassberger · 2003
Earlier work this paper cites.
Population annealing and its application to a spin glass
K. Hukushima and Y. Iba · 2003
Earlier work this paper cites.
From fields to trees: On blocked and collapsed mcmc algorithms for undirected probabilistic graphical models
F. Hamze and N. de Freitas · 2004
Earlier work this paper cites.
A Guide to Monte Carlo Simulations in Statistical Physics
D. P. Landau and K. Binder · 2005
Cited alongside, same era.
On contrastive divergence learning
M. Á. Carreira-Perpiñán and G. E. Hinton · 2005
Cited alongside, same era.
Graphical models, exponential families, and variational inference
M. J. Wainwright and M. I. Jordan · 2008
Cited alongside, same era.
Statistically optimal analysis of samples from multiple equilibrium states
M. R. Shirts and J. D. Chodera · 2008
Cited alongside, same era.
Deep Boltzmann machines
R. Salakhutdinov and G. Hinton · 2009
Cited alongside, same era.
Information, Physics, and Computation
M. Mezard and A. Montanari · 2009
Cited alongside, same era.
Efficient subgraph-based sampling of Ising-type models with frustration
A. Selby · 2014
Later among the works it cites.
Architectural considerations in the design of a superconducting quantum annealing processor
P. Bunyk, E. M. Hoskinson, M. W. Johnson, E. Tolkacheva, F. Altomare, A. J. Berkley, R. Harris, J. P. Hilton, T. Lanting, A. J. Przybysz, and J. Whittaker · 2014
Later among the works it cites.
On the challenges of physical implementations of RBMs
V. Dumoulin, I.J. Goodfellow, A. Courville, and Y. Bengio · 2015
Later among the works it cites.
M. Benedetti, J. Realpe-Gómez, R. Biswas, and A. Perdomo-Ortiz · 2015
Later among the works it cites.
Searching for quantum speedup in quasistatic quantum annealers
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. M. Long and R. Servedio · 2010
Cited alongside, same era.
The Ising model: teaching an old problem new tricks
Z. Bian, F. Chudak, W. G. Macready, and G. Rose · 2010
Cited alongside, same era.
Toward the implementation of a quantum RBM
M. Denil and N. de Freitas · 2011
Cited alongside, same era.
Quantum annealing with manufactured spins
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose · 2011
Cited alongside, same era.
Inverse I
E. Aurell and M. Ekeberg · 2012
Cited alongside, same era.
Mean-field theory for the inverse I
H. C. Nguyen and J. Berg · 2012
Cited alongside, same era.
M. H. Amin · 2015
Later among the works it cites.
Degeneracy, degree, and heavy tails in quantum annealing
A. D. King, E. Hoskinson, T. Lanting, E. Andriyash, and M. H. Amin · 2015
Later among the works it cites.
Benchmarking a quantum annealing processor with the time-to-target metric
J. King, S. Yarkoni, M. M. Nevisi, J. P. Hilton, and C. C. McGeoch · 2015
Later among the works it cites.
What is the computational value of finite range tunneling?
V. S. Denchev, S. Boixo, S. V. Isakov, N. Ding, R. Babbush, V. Smelyanskiy, J. Martinis, and H. Neven · 2015
Later among the works it cites.
Computational implications of reducing data to sufficient statistics
A. Montanari · 2015
Later among the works it cites.
B. B. Bhattacharya and S. Mukherjee · 2015
Later among the works it cites.
Theory and Applications of Satisfiability Testing – SAT 2015: 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings
A. Douglass, A. D. King, and J. Raymond · 2015
Later among the works it cites.
Quantum optimization of fully connected spin glasses
D. Venturelli, S. Mandrà, S. Knysh, B. O’Gorman, R. Biswas, and V. Smelyanskiy · 2015
Later among the works it cites.
Optimised simulated annealing for Ising spin glasses
S. V. Isakov, I. N. Zintchenko, T. F. Rønnow, and M. Troyer · 2015
Later among the works it cites.
Efficient cluster algorithm for spin glasses in any space dimension
Z. Zhu, A. J. Ochoa, and H.G. Katzgraber · 2015
Later among the works it cites.
M. H. Amin, E. Andriyash, J. Rolfe, B. Kulchytskyy, and R. Melko · 2016
Closest in time.
Determination and correction of persistent biases in quantum annealers
A. Perdomo-Ortiz, B. O’Gorman, R. Biswas, and V. N. Smelyanskiy · 2016
Closest in time.