A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing—Abridged Version

Alastair A. Abbott
Cristian S. Calude
Michael J. Dinneen
Richard Hua

Quantum annealing has shown significant potential as an approach to near-term quantum computing. Despite promising progress towards obtaining a quantum speedup, quantum annealers are limited by the need to embed problem instances within the (often highly restricted) connectivity graph of the annealer. This embedding can be costly to perform and may destroy any computational speedup. Here we present a hybrid quantum-classical paradigm to help mitigate this limitation, and show how a raw speedup that is negated by the embedding time can nonetheless be exploited in certain circumstances. We illustrate this approach with initial results on a proof-of-concept implementation of an algorithm for the dynamically weighted maximum independent set problem.

In Michael Cuffaro and Philippos Papayannopoulos: Proceedings of the 9th International Workshop on Physics and Computation (PC 2018), Fontainebleau, France, 26 June 2018, Electronic Proceedings in Theoretical Computer Science 273, pp. 1–13.
Published: 2nd July 2018.

ArXived at: http://dx.doi.org/10.4204/EPTCS.273.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org