Systematic and Deterministic Graph-Minor Embedding for Cartesian Products of Graphs

Understand

The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods.

• These methods allow non-native problems to be adapted to the target annealer's architecture.
• The overhead of the widely used heuristic techniques is quickly proving to be a significant bottleneck for solving real-world applications.
• To alleviate this difficulty, we propose a systematic and deterministic embedding method, exploiting the structures of both the input graph of the specific problem and the quantum annealer.