Leveraging Adiabatic Quantum Computation for Election Forecasting
arXiv:1802.00069 · doi:10.7566/JPSJ.88.061009
Abstract
Accurate, reliable sampling from fully-connected graphs with arbitrary correlations is a difficult problem. Such sampling requires knowledge of the probabilities of observing every possible state of a graph. As graph size grows, the number of model states becomes intractably large and efficient computation requires full sampling be replaced with heuristics and algorithms that are only approximations of full sampling. This work investigates the potential impact of adiabatic quantum computation for sampling purposes, building on recent successes training Boltzmann machines using a quantum device. We investigate the use case of quantum computation to train Boltzmann machines for predicting the 2016 Presidential election.
arXiv comment12 pages, 6 figures
References in corpus (6)
- Quantum Machine Learning
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning
- Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models
- Quantum-assisted Helmholtz machines: A quantum-classical deep learning framework for industrial datasets in near-term devices
- Temperature scaling law for quantum annealing optimizers