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

TL;DR

This paper proposes a hybrid quantum-classical approach to reduce embedding costs in quantum annealing, enabling potential speedups despite embedding overheads, demonstrated on a maximum independent set problem.

Contribution

It introduces a novel hybrid paradigm that mitigates embedding costs in quantum annealing, enhancing practical quantum speedup prospects.

Findings

Hybrid approach reduces embedding overheads

Initial results show potential for speedup in specific problems

Demonstrated on maximum independent set problem

Abstract

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.