Benchmarking Quantum Feature Encoding Strategies for Binary Classification with QSVM

• URL: http://arxiv.org/abs/2608.27764v1
• Date: Thu, 27 Aug 2026 22:55:12 GMT
• Title: Benchmarking Quantum Feature Encoding Strategies for Binary Classification with QSVM
• Abstract summary: The effects of different quantum feature encoding strategies on Quantum Support Vector Machine performance were investigated.<n>The results show that incorporating statistical relationships into the encoding process can influence classification performance.<n>More complex and densely entangled circuits do not necessarily yield higher performance.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The way in which classical data are encoded into quantum states plays a significant role in both classification performance and quantum circuit complexity in Quantum Machine Learning. In this study, the effects of different quantum feature encoding strategies on Quantum Support Vector Machine performance were investigated using five binary classification datasets. In particular, the statistical relationships between features were incorporated into quantum circuits through \(RY(θ)\) and controlled-\(RY(θ)\) gates, and this approach was compared with conventional quantum feature maps. The results demonstrate that incorporating statistical relationships into the encoding process can influence classification performance. However, more complex and densely entangled circuits do not necessarily yield higher performance. In addition, a composite evaluation metric was employed to jointly assess predictive performance, generalization, and circuit cost. The findings across the five datasets indicate that the choice of quantum feature encoding strategy should account for the underlying structure of the data and that predictive performance should be evaluated together with quantum circuit complexity.

Related papers

• A Correlation Aware Quantum Feature Map for Variational Quantum Classification [0.0]
  Correlation Aware Quantum Feature Map (CAQFM) integrates feature dependencies into the quantum encoding process.<n>The proposed approach utilizes Pearson, Spearman, Kendall Tau, Mutual Information, and Distance Correlation measures to identify relationships among features.<n>Results demonstrate that correlation based quantum encoding can improve classification performance compared to conventional encoding strategies.
  arXiv  Detail & Related papers  (2026-06-19T16:12:10Z)
• Parametrized Quantum Circuit Learning for Quantum Chemical Applications [6.0891078426115826]
  Parametrized quantum circuits (PQCs) provide a promising hybrid framework for tackling complex machine learning problems.<n>In this study, we investigate the potential benefits and limitations of PQCs on two chemically meaningful datasets.<n>We construct a comprehensive set of 168 PQCs by combining 14 data encoding strategies with 12 variational ans"atze, and evaluate their performance on circuits with 5 and 16 qubits.
  arXiv  Detail & Related papers  (2025-07-10T21:35:33Z)
• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Benchmarking quantum machine learning kernel training for classification tasks [0.0]
  This study focuses on quantum kernel methods in the context of classification tasks.<n>It examines the performance of Quantum Kernel Estimation (QKE) and Quantum Kernel Training (QKT) in connection with two quantum feature mappings.<n> Experimental results indicate that quantum methods exhibit varying performance across different datasets.
  arXiv  Detail & Related papers  (2024-08-17T10:53:06Z)
• Profiling quantum circuits for their efficient execution on single- and multi-core architectures [1.7340157845783293]
  This study introduces graph theory-based metrics extracted from their qubit interaction graph and gate dependency graph. It uncovers a connection between parameters rooted in both qubit interaction and gate dependency graphs, and the performance metrics for quantum circuit mapping.
  arXiv  Detail & Related papers  (2024-07-17T15:08:50Z)
• Understanding the effects of data encoding on quantum-classical convolutional neural networks [0.0]
  A key component of quantum-enhanced methods is the data encoding strategy used to embed the classical data into quantum states. This work investigates how the data encoding impacts the performance of a quantum-classical convolutional neural network (QCCNN) on two medical imaging datasets.
  arXiv  Detail & Related papers  (2024-05-05T18:44:08Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques [1.351147045576948]
  We propose to extend the characterization of quantum circuits by including qubit interaction graph properties. Our study reveals a correlation between interaction graph-based parameters and mapping performance metrics for various existing configurations of quantum devices.
  arXiv  Detail & Related papers  (2022-12-13T15:24:37Z)
• When BERT Meets Quantum Temporal Convolution Learning for Text Classification in Heterogeneous Computing [75.75419308975746]
  This work proposes a vertical federated learning architecture based on variational quantum circuits to demonstrate the competitive performance of a quantum-enhanced pre-trained BERT model for text classification. Our experiments on intent classification show that our proposed BERT-QTC model attains competitive experimental results in the Snips and ATIS spoken language datasets.
  arXiv  Detail & Related papers  (2022-02-17T09:55:21Z)
• 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)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.