TL;DR
Ember is an open-source benchmarking suite for quantum annealing embedding algorithms, providing standardized tests, diverse graph instances, and analysis tools to enable reliable cross-algorithm comparison.
Contribution
We introduce Ember, a comprehensive, reproducible benchmarking framework with diverse graph libraries and analysis pipelines for quantum annealing embedding algorithms.
Findings
No single algorithm dominates across all graph types.
Embedding performance varies systematically with graph structure.
Hardware topology and qubit error rates significantly affect embedding quality.
Abstract
Minor embedding is a required compilation step for quantum annealing, mapping logical problem graphs onto sparse hardware topologies. Despite its central role in determining solution quality, no standardized benchmark exists for comparing embedding algorithms: prior studies use incompatible graph libraries, inconsistent metrics, and non-reproducible experimental setups, making cross-algorithm comparisons unreliable. We present Ember (Embedding Minor Benchmark for Evaluative Reproducibility), an open-source benchmarking framework addressing this gap. Ember provides a standardized algorithm interface with seeded, reproducible execution infrastructure; a diverse graph library of 24,016 instances spanning structured, random, and physics-motivated problem types not previously used in embedding benchmarks; and a unified analysis pipeline supporting all three current D-Wave hardware topologies…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
