Qmes: Quantum Meta-Learning for Encoding Selection in Quantum Kernel Methods

• URL: http://arxiv.org/abs/2609.04652v1
• Date: Fri, 04 Sep 2026 02:34:55 GMT
• Title: Qmes: Quantum Meta-Learning for Encoding Selection in Quantum Kernel Methods
• Abstract summary: We present Qmes, an open-source Python package that automatically recommends circuits through meta-learning.<n>Qmes characterizes a dataset using classical complexity measures and queries a pre-trained model to recommend circuits.<n>We validate Qmes on 105 classification and 86 regression benchmark datasets.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Selecting an effective encoding quantum circuit is a key challenge in quantum kernel methods because different feature maps can lead to different performance. Conventional methods require constructing and evaluating every circuit for each new dataset, making it computationally expensive. We present Qmes, an open-source Python package that automatically recommends circuits through meta-learning. Qmes characterizes a dataset using classical complexity measures and queries a pre-trained model to recommend circuits without quantum evaluation at inference time. The package provides modular components for meta-feature extraction, quantum-kernel evaluation, recommender training, model selection, and user-defined circuit extension. We validate Qmes on 105 classification and 86 regression benchmark datasets. Qmes reduces the mean recommendation regret by 2.2x and 4.2x for classification and regression, respectively, compared to a non-adaptive baseline, with statistical significance confirmed via a paired Wilcoxon signed-rank test ($p < 10^{-4}$). Qmes thus enables efficient and practical encoding-circuit selection for quantum kernel methods.

Related papers

• Towards Fair Benchmarking of Quantum Transfer Learning for Visual Classification [2.417944170423441]
  Quantum Transfer Learning offers a promising approach for visual quantum machine learning under near-term constraints.<n>Existing QTL results are difficult to compare because they often differ in datasets, preprocessing, backbone settings, qubit budgets, circuit designs, optimization choices, and reporting protocols.<n>This work presents a controlled benchmarking methodology for evaluating representative QTL methods under a unified transfer-learning pipeline.
  arXiv  Detail & Related papers  (2026-05-19T06:10:32Z)
• Towards Automated Selection of Quantum Encoding Circuits via Meta-Learning [0.0]
  In this paper, we propose an automated recommender that utilizes the characteristics of intrinsic datasets to predict the optimal encoding circuit.<n>Nine candidates are assessed alongside 24 classical complexity metrics serving as features, evaluated through two training approaches with four configurations, along with 14 machine learning models.<n>Both approaches achieve Top-3 accuracy of up to 85.7% in identifying the best-performing encoding circuit, and demonstrate that classical data complexity metrics provide sufficient predictive signal for circuit selection.
  arXiv  Detail & Related papers  (2026-04-21T04:37:38Z)
• Graph-Based Bayesian Optimization for Quantum Circuit Architecture Search with Uncertainty Calibrated Surrogates [2.271697926182248]
  We present an automated framework that discovers and refines variational quantum circuits.<n>Circuits are represented as graphs and mutated and selected via an expected improvement acquisition function.<n>The GNN-guided pipeline consistently finds circuits with lower complexity and competitive or superior classification accuracy.
  arXiv  Detail & Related papers  (2025-12-10T12:23:04Z)
• QMetric: Benchmarking Quantum Neural Networks Across Circuits, Features, and Training Dimensions [0.0]
  We present QMetric, a Python package offering a suite of interpretable metrics to evaluate quantum circuit expressibility.<n>QMetric quantifies key aspects such as circuit fidelity, entanglement entropy, barren plateau risk, and training stability.
  arXiv  Detail & Related papers  (2025-06-30T12:12:01Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Data Complexity Measures for Quantum Circuits Architecture Recommendation [55.74527632797241]
  Quantum Parametric Circuits are constructed as an alternative to reduce the size of quantum circuits.<n> determining the optimal circuit for a given problem remains an open question.<n>In this work, a quantum circuit recommendation architecture for classification problems is proposed using database complexity measures.
  arXiv  Detail & Related papers  (2025-02-21T01:17:24Z)
• Integrated Encoding and Quantization to Enhance Quanvolutional Neural Networks [2.789685107745028]
  We propose two ways to enhance the efficiency of quanvolutional models. First, we propose a flexible data quantization approach with memoization, applicable to any encoding method. Second, we introduce a new integrated encoding strategy, which combines the encoding and processing steps in a single circuit.
  arXiv  Detail & Related papers  (2024-10-08T07:57:13Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Transfer Learning in Quantum Parametric Classifiers: An Information-Theoretic Generalization Analysis [42.275148861039895]
  A key step in quantum machine learning with classical inputs is the design of an embedding circuit mapping inputs to a quantum state. This paper studies a transfer learning setting in which classical-to-quantum embedding is carried out by an arbitrary parametric quantum circuit.
  arXiv  Detail & Related papers  (2022-01-17T09:28:13Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.