An Overview of Approaches to Modernize Quantum Annealing Using Local Searches
arXiv:1606.06800 · doi:10.4204/EPTCS.214.4
Abstract
I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm. The quantum annealing algorithm is an analogue of simulated annealing, a classical numerical technique which is now obsolete. Hence, I explore strategies to use an annealer in a way which takes advantage of modern classical optimization algorithms, and additionally should be less sensitive to problem mis-specification then the traditional quantum annealing algorithm.
In Proceedings PC 2016, arXiv:1606.06513. An extended version of this contribution will appear on arXiv soon which will describe more detailed algorithms, comment more on robustness to problem mis-specification, comment on thermal sampling applications, and discuss applications on real devices
References in corpus (7)
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- Application of Quantum Annealing to Training of Deep Neural Networks
- Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
- Population annealing: Theory and application in spin glasses
- Maximum-Entropy Inference with a Programmable Annealer
- Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
- Experimental Freezing of mid-Evolution Fluctuations with a Programmable Annealer