Fetching the paper…
Reading the bibliography…
Mainstream machine-learning techniques such as deep learning and probabilistic programming rely heavily on sampling from generally intractable probability distributions.
S Kirkpatrick, CD Gelatt, and MP Vecchi, “Optimization by simulated annealing,” Science 220
1983
Earlier work this paper cites.
David H Ackley, Geoffrey E Hinton, and Terrence J Sejnowski, “A learning algorithm for boltzmann machines,” Cognitive science 9
1985
Earlier work this paper cites.
M. Mezard, G. Parisi, and M.A. Virasoro, Spin Glass Theory and Beyond , Lecture Notes in Physics Series (World Scientific, 1987)
1987
Earlier work this paper cites.
Alistair Sinclair and Mark Jerrum, “Approximate counting, uniform generation and rapidly mixing markov chains,” Inf. Comput. 82
1989
Earlier work this paper cites.
AB Finnila, MA Gomez, C Sebenik, C Stenson, and JD Doll, “Quantum annealing: a new method for minimizing multidimensional functions,” Chemical Physics Letters 219
1994
Earlier work this paper cites.
Arnoldo Frigessi, Fabio Martinelli, and Julian Stander, “Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields,” Biometrika 84
1997
Earlier work this paper cites.
Tadashi Kadowaki and Hidetoshi Nishimori, “Quantum annealing in the transverse ising model,” Phys. Rev. E. 58
1998
Earlier work this paper cites.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda, “A quantum adiabatic evolution algorithm applied to random instances of an NP-Complete problem,” Science 292
2001
Earlier work this paper cites.
H. Nishimori, Statistical Physics of Spin Glasses and Information Processing: An Introduction , International series of monographs on physics (Oxford University Press, 2001)
2001
Earlier work this paper cites.
Andrew Y Ng and Michael I Jordan, “On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes,” in Advances in neural information processing systems (2002) pp. 841–848
2002
Earlier work this paper cites.
David J. C. MacKay, Information Theory, Inference & Learning Algorithms (Cambridge University Press, 2003)
2003
Earlier work this paper cites.
E.T. Jaynes and G.L. Bretthorst, Probability Theory: The Logic of Science (Cambridge University Press, 2003)
2003
Earlier work this paper cites.
James C. Spall, Introduction to Stochastic Search and Optimization , 1st ed. (John Wiley & Sons, Inc., New York, NY, USA, 2003)
2003
Earlier work this paper cites.
Elad Schneidman, Michael J. Berry, Ronen Segev, and William Bialek, “Weak pairwise correlations imply strongly correlated network states in a neural population,” Nature 440
2006
Earlier work this paper cites.
Vicky Choi, “Minor-embedding in adiabatic quantum computation: I. the parameter setting problem,” Quantum Information Processing 7
2008
Earlier work this paper cites.
Harmut Neven, Vasil S Denchev, Marshall Drew-Brook, Jiayong Zhang, William G Macready, and Geordie Rose, “Binary classification using hardware implementation of quantum annealing,” in Demonstrations at NIPS-09, 24th Annual Conference on Neural Information Processing Systems (2009) pp. 1–17
2009
Earlier work this paper cites.
Marc Mezard and Andrea Montanari, Information, Physics, and Computation (Oxford University Press, Inc., New York, NY, USA, 2009)
2009
Earlier work this paper cites.
Marc Mézard and Thierry Mora, “Constraint satisfaction problems and neural networks: A statistical physics perspective,” Journal of Physiology-Paris 103
2009
Earlier work this paper cites.
Zhengbing Bian, Fabian Chudak, William G Macready, and Geordie Rose, The Ising model: teaching an old problem new tricks , Tech. Rep. (D-Wave Systems, 2010)
2010
Earlier work this paper cites.
Misha Denil and Nando De Freitas, “Toward the implementation of a quantum RBM,” NIPS Deep Learning and Unsupervised Feature Learning Workshop (2011)
2011
Earlier work this paper cites.
Vicky Choi, “Minor-embedding in adiabatic quantum computation: Ii. minor-universal graph design,” Quantum Information Processing 10
2011
Earlier work this paper cites.
Iacopo Mastromatteo and Matteo Marsili, “On the criticality of inferred models,” Journal of Statistical Mechanics: Theory and Experiment 2011
2011
Earlier work this paper cites.
Nathan Wiebe, Daniel Braun, and Seth Lloyd, “Quantum algorithm for data fitting,” Physical review letters 109
2012
Earlier work this paper cites.
Mile Gu, Karoline Wiesner, Elisabeth Rieper, and Vlatko Vedral, “Quantum mechanics can reduce the complexity of classical models,” Nature Communications 3
2012
Earlier work this paper cites.
Frank Gaitan and Lane Clark, “Ramsey numbers and adiabatic quantum computing,” Phys. Rev. Lett. 108
2012
Earlier work this paper cites.
A. Perdomo-Ortiz, N. Dickson, M. Drew-Brook, G. Rose, and A. Aspuru-Guzik, “Finding low-energy conformations of lattice protein models by quantum annealing,” Sci. Rep. 2
2012
Earlier work this paper cites.
Federico Ricci-Tersenghi, “The bethe approximation for solving the inverse ising problem: a comparison with other inference methods,” Journal of Statistical Mechanics: Theory and Experiment 2012
2012
Cited alongside, same era.
Geoffrey E. Hinton, “A practical guide to training restricted boltzmann machines.” in Neural Networks: Tricks of the Trade (2nd ed.) , Lecture Notes in Computer Science, Vol. 7700, edited by Grégoire Montavon, Genevieve B. Orr, and Klaus-Robert Müller (Springer, 2012) pp. 599–619
2012
Cited alongside, same era.
2012
Cited alongside, same era.
Kristen L. Pudenz and Daniel A. Lidar, “Quantum adiabatic machine learning,” Quantum Information Processing 12
2013
Cited alongside, same era.
Wolfgang Lechner, Philipp Hauke, and Peter Zoller, “A quantum annealing architecture with all-to-all connectivity from local interactions,” Science advances 1
2015
Later among the works it cites.
Ian Goodfellow Yoshua Bengio and Aaron Courville, “Deep learning,” (2016), MIT Press
2016
Closest in time.
Ian Goodfellow, “Nips 2016 tutorial: Generative adversarial networks,” arXiv:1701.00160 (2016)
2016
Closest in time.
Maria Schuld, Ilya Sinayskiy, and Francesco Petruccione, “Prediction by linear regression on a quantum computer,” Physical Review A 94
2016
Closest in time.
Marcello Benedetti, John Realpe-Gómez, Rupak Biswas, and Alejandro Perdomo-Ortiz, “Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning,” Phys. Rev. A 94
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
M. Lichman, “UCI machine learning repository,” (2013)
2013
Cited alongside, same era.
Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd, “Quantum support vector machine for big data classification,” Phys. Rev. Lett. 113
2014
Cited alongside, same era.
Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost, “Quantum principal component analysis,” Nature Physics 10
2014
Cited alongside, same era.
Zhengbing Bian, Fabian Chudak, Robert Israel, Brad Lackey, William G Macready, and Aidan Roy, “Discrete optimization using quantum annealing on sparse ising models,” Frontiers in Physics 2
2014
Cited alongside, same era.
V. Dumoulin, I. J. Goodfellow, A. C. Courville, and Y. Bengio, “On the challenges of physical implementations of RBMs,” in Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada. (2014) pp. 1199–1205
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2016
Closest in time.
Nicholas Chancellor, Szilard Szoke, Walter Vinci, Gabriel Aeppli, and Paul A Warburton, “Maximum-entropy inference with a programmable annealer,” Scientific reports 6
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
Alejandro Perdomo-Ortiz, Bryan O’Gorman, Joseph Fluegemann, Rupak Biswas, and Vadim N. Smelyanskiy, “Determination and correction of persistent biases in quantum annealers,” Sci. Rep. 6
2016
Closest in time.
2016
Closest in time.
Guoming Wang, “Quantum algorithm for linear regression,” Physical Review A 96
2017
Closest in time.
Lucas Lamata, “Basic protocols in quantum reinforcement learning with superconducting circuits,” Scientific Reports 7
2017
Closest in time.
Peter Wittek and Christian Gogolin, “Quantum enhanced inference in markov logic networks,” Scientific Reports 7
2017
Closest in time.
2017
Closest in time.
Jonathan Romero, Jonathan P Olson, and Alan Aspuru-Guzik, “Quantum autoencoders for efficient compression of quantum data,” Quantum Sci. Technol. 2
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
Salvatore Mandrà, Zheng Zhu, and Helmut G. Katzgraber, “Exponentially biased ground-state sampling of quantum annealing machines with transverse-field driving hamiltonians,” Phys. Rev. Lett. 118
2017
Closest in time.
John Realpe-Gómez, “Quantum as self-reference,” arXiv preprint arXiv:1705.04307 (2017)
2017
Closest in time.
Joshua Job and Daniel Lidar, “Test-driving 1000 qubits,” arXiv:1706.07124 (2017)
2017
Closest in time.