Towards Automated Selection of Quantum Encoding Circuits via Meta-Learning
- URL: http://arxiv.org/abs/2604.19076v1
- Date: Tue, 21 Apr 2026 04:37:38 GMT
- Title: Towards Automated Selection of Quantum Encoding Circuits via Meta-Learning
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In recent years, quantum kernel methods have shown promising applications on near-term quantum devices. However, selecting an appropriate encoding circuit for a given dataset requires costly evaluation of multiple candidates, formulated as a meta-learning problem. In this paper, we propose an automated recommender that utilizes the intrinsic characteristics of datasets to predict the optimal circuit without any quantum evaluation. 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. 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.
Related papers
- Qmes: Quantum Meta-Learning for Encoding Selection in Quantum Kernel Methods [0.0]
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.
arXiv Detail & Related papers (2026-09-04T02:34:55Z) - Transpiler Autotuning with Predictive Models for Quantum Circuit Optimization [1.039769242219222]
We build a predictive model extension for the Qiskit transpilation pipeline that uses a machine learning model to automatically select combinations of transpiler passes aiming to achieve a maximum reduction in two-qubit gates.<n>Our empirical evaluation shows that the combinations selected by our model are never outperformed by Qiskit's optimization levels, achieve on average an additional 19.1$%$ - 32.4$%$ reduction in two-qubit gates, and for some circuits finds reductions of up to $95.8%$ in cases where Qiskit achieves no reduction at all.
arXiv Detail & Related papers (2026-07-31T08:23:43Z) - Regression of Functions by Quantum Neural Networks Circuits [41.09105068326236]
This work investigates automated quantum-circuit construction for regression tasks.<n>It introduces a genetic-algorithm framework that discovers Reduced Regressor QNN architectures.
arXiv Detail & Related papers (2025-12-23T01:58:03Z) - Graph Neural Network-Based Predictor for Optimal Quantum Hardware Selection [0.21845291030915975]
We propose a Graph Neural Network (GNN)-based predictor that automates hardware selection.<n>By exploiting graph-based machine learning, our approach avoids extracting the circuit features for the model evaluation.<n> Experimental results prove 94.4% accuracy and an 85.5% F1 score for the minority class, effectively predicting the best compilation target.
arXiv Detail & Related papers (2025-07-25T09:23:04Z) - 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) - Supervised binary classification of small-scale digit images and weighted graphs with a trapped-ion quantum processor [56.089799129458875]
We present the results of benchmarking a quantum processor based on trapped $171$Yb$+$ ions.<n>We perform a supervised binary classification on two types of datasets: small binary digit images and weighted graphs with a ring topology.
arXiv Detail & Related papers (2024-06-17T18:20:51Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - Encoding optimization for quantum machine learning demonstrated on a
superconducting transmon qutrit [1.6460874590065597]
Three-level quantum systems have the advantage of requiring fewer components than the typically used two-level qubits.
This work investigates the potential of qutrit parametric circuits in machine learning classification applications.
arXiv Detail & Related papers (2023-09-22T17:53:16Z) - 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) - Polyadic Quantum Classifier [0.0]
We introduce here a supervised quantum machine learning algorithm for multi-class classification on NISQ architectures.
A parametric quantum circuit is trained to output a specific bit string corresponding to the class of the input datapoint.
We train and test it on an IBMq 5-qubit quantum computer and the algorithm shows good accuracy.
arXiv Detail & Related papers (2020-07-28T08:00:12Z) - 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.