Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms

• URL: http://arxiv.org/abs/2604.25433v2
• Date: Wed, 06 May 2026 04:47:32 GMT
• Title: Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms
• Abstract summary: Minor embedding is required to map logical problem graphs onto sparse hardware topologies.<n>Prior studies use incompatible graph libraries, inconsistent metrics, and non-reproducible experimental setups, making cross-algorithm comparisons unreliable.<n>We present Ember, an open-source benchmarking framework addressing this gap.
• Score: 0.4132158161225705
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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 (Chimera, Pegasus, Zephyr). We evaluate five algorithms across the full library on Chimera and find that no algorithm dominates universally: rankings vary systematically with graph structure, and the best algorithm depends on the family being embedded. We also examine the effects of hardware topology (including Pegasus and Zephyr), qubit error rates, and evaluate a reinforcement-learning approach (CHARME) within a narrower test set. Ember is available at https://github.com/zachmacsmith/ember and is installable via pip install ember-qc.

Related papers

• Scaling Weisfeiler-Leman Expressiveness Analysis to Massive Graphs with GPUs [0.4396860522241306]
  Graph Neural Networks are built on the stable coloring of the Weisfeiler-Leman (1-WL)<n>Classic algorithms are inherently sequential and cannot exploit modern massively parallel hardware.<n>We leverage a linear algebraic interpretation of 1-WL stable coloring and introduce two key contributions.<n>For the first time, successfully computes stable colorings on web-scale graphs with over 30 billion edges, where CPU baselines time out or fail.
  arXiv  Detail & Related papers  (2026-07-01T13:11:31Z)
• GMatch: A Lightweight, Geometry-Constrained Keypoint Matcher for Zero-Shot 6DoF Pose Estimation in Robotic Grasp Tasks [9.107487205419604]
  6DoF object pose estimation is fundamental to robotic grasp tasks.<n>GMatch is a lightweight, geometry-constrained keypoint matcher that can run efficiently on embedded CPU-only platforms.
  arXiv  Detail & Related papers  (2025-05-22T02:39:52Z)
• GRADE: Grover-based Benchmarking Toolkit for Assessing Quantum Hardware [0.0]
  We introduce GRADE, an open-source benchmarking toolkit to evaluate the reliability of quantum hardware.<n>GRADE operates by implementing Grover's algorithm to search through a variety of primitive collections.<n>GRADE can adapt to a wide range of quantum computing platforms, ensuring it can be applied across different hardware architectures.
  arXiv  Detail & Related papers  (2025-04-27T23:28:18Z)
• Stable Structure Learning with HC-Stable and Tabu-Stable Algorithms [6.691151987390148]
  We show that some widely-used score-based algorithms, as well as hybrid and constraint-based algorithms, suffer from the same issue.<n>We propose a novel solution for score-based greedy hill-climbing that eliminates instability by determining a stable node order.<n>Two implementations, HC-Stable and Tabu-Stable, are introduced. Tabu-Stable achieves the highest BIC scores across all networks, and the highest accuracy for categorical networks.
  arXiv  Detail & Related papers  (2025-04-02T13:51:44Z)
• Fast Approximation of Similarity Graphs with Kernel Density Estimation [12.321755440062732]
  We present a new algorithm for constructing a similarity graph from a set $X$ of data points in $mathbbRd$. Our presented algorithm is based on the kernel density estimation problem, and is applicable for arbitrary kernel functions.
  arXiv  Detail & Related papers  (2023-10-21T00:32:47Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search [55.75621026447599]
  We propose NAS-Bench-Graph, a tailored benchmark that supports unified, reproducible, and efficient evaluations for GraphNAS. Specifically, we construct a unified, expressive yet compact search space, covering 26,206 unique graph neural network (GNN) architectures. Based on our proposed benchmark, the performance of GNN architectures can be directly obtained by a look-up table without any further computation.
  arXiv  Detail & Related papers  (2022-06-18T10:17:15Z)
• Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search [57.18075258042082]
  This competition compares ANNS algorithms at billion-scale by hardware cost, accuracy and performance. We compiled six diverse billion-scale datasets, four newly released for this competition.
  arXiv  Detail & Related papers  (2022-05-08T02:41:54Z)
• Simple Stochastic and Online Gradient DescentAlgorithms for Pairwise Learning [65.54757265434465]
  Pairwise learning refers to learning tasks where the loss function depends on a pair instances. Online descent (OGD) is a popular approach to handle streaming data in pairwise learning. In this paper, we propose simple and online descent to methods for pairwise learning.
  arXiv  Detail & Related papers  (2021-11-23T18:10:48Z)
• MQBench: Towards Reproducible and Deployable Model Quantization Benchmark [53.12623958951738]
  MQBench is a first attempt to evaluate, analyze, and benchmark the and deployability for model quantization algorithms. We choose multiple platforms for real-world deployments, including CPU, GPU, ASIC, DSP, and evaluate extensive state-of-the-art quantization algorithms. We conduct a comprehensive analysis and find considerable intuitive or counter-intuitive insights.
  arXiv  Detail & Related papers  (2021-11-05T23:38:44Z)
• GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra [9.814439564341761]
  GraphMineSuite (GMS) is a benchmarking suite for graph mining algorithms. GMS comes with a benchmark specification based on extensive review, literature prescribing representative problems, algorithms, and datasets.
  arXiv  Detail & Related papers  (2021-03-05T13:26:18Z)
• Torch-Struct: Deep Structured Prediction Library [138.5262350501951]
  We introduce Torch-Struct, a library for structured prediction. Torch-Struct includes a broad collection of probabilistic structures accessed through a simple and flexible distribution-based API.
  arXiv  Detail & Related papers  (2020-02-03T16:43:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.