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.
- Pub Date:
- June 2016
- Computer Science - Emerging Technologies;
- Quantum Physics
- 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