Support Vector Machine with a Scalable Quantum Kernel

• URL: http://arxiv.org/abs/2605.31449v1
• Date: Fri, 29 May 2026 15:43:05 GMT
• Title: Support Vector Machine with a Scalable Quantum Kernel
• Abstract summary: Quantum support vector machines rely on quantum-generated kernels.<n> fidelity quantum kernel suffers from exponential concentration as system size increases.<n>Hamming quantum kernel avoids the exponential concentration problem by using the full measurement statistics.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum support vector machines are classification algorithms that rely on quantum-generated kernels. The fidelity quantum kernel commonly used in quantum support vector machines suffers from exponential concentration as system size increases, preventing an efficient scaling beyond fewqubit systems. We introduce the Hamming quantum kernel, a classical post-processing method that is based on the same measurement outcomes as the fidelity quantum kernel. However, it avoids the exponential concentration problem by using the full measurement statistics rather than a single fidelity value. We evaluate the approach on both classical data (MNIST) and synthetic data generated from quantum circuits, using systems ranging from 2 to 27 qubits. Throughout the simulations, the Hamming quantum kernel outperforms the fidelity quantum kernel whenever 15 or more qubits are used. Furthermore, for synthetic quantum data, our method consistently outperforms the classical Gaussian kernel. This demonstrates that the Hamming quantum kernel improves the expressivity and robustness at larger qubit scales without requiring any additional quantum ressources.

Related papers

• Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization [50.880384999888044]
  We develop misspecified GP bandit algorithms and derive regret bounds that characterize the trade-off between approximation error and information gain.<n>Our methods outperform full quantum kernels in sample efficiency, while substantially reducing computational overhead.
  arXiv  Detail & Related papers  (2026-07-01T15:38:00Z)
• Automatic De-Quantization of Quantum Programs Using Constant Propagation [42.89658025409898]
  Every quantum operation is costly, making it crucial to minimize quantum resource usage in near-term algorithms.<n>In this work, we focus on de-quantizing quantum operations to classical computation whenever possible.<n>We formalize a hybrid state model for quantum-classical constant propagation, implement our optimizations in the open-source MQT Core tool, and evaluate them on benchmark circuits.
  arXiv  Detail & Related papers  (2026-05-21T19:21:11Z)
• Benign Overfitting with Quantum Kernels [5.499796332553708]
  Quantum kernels quantify similarity between data points by measuring the inner product between quantum states.<n>We propose a novel strategy for constructing quantum kernels that achieve good generalization performance.
  arXiv  Detail & Related papers  (2025-03-21T10:30:42Z)
• Quantum-Efficient Kernel Target Alignment [0.0]
  We investigate KTA-trained quantum embedding kernels and employ a low-rank matrix approximation, the Nystr"om method, to reduce the quantum circuit executions needed to construct the Kernel Matrix.<n>We empirically evaluate the performance of our approach across various datasets, focusing on the accuracy of the resulting SVM and the reduction in quantum circuit executions.
  arXiv  Detail & Related papers  (2025-02-12T09:08:51Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Benchmarking of quantum fidelity kernels for Gaussian process regression [1.7287035469433212]
  Quantum computing algorithms have been shown to produce performant quantum kernels for machine-learning classification problems. We show that quantum kernels can achieve the same, though not better, expressivity as classical kernels for regression problems.
  arXiv  Detail & Related papers  (2024-07-22T18:19:48Z)
• Quantum Machine Learning: Quantum Kernel Methods [0.0]
  Kernel methods are a powerful and popular technique in classical Machine Learning. The use of a quantum feature space that can only be calculated efficiently on a quantum computer potentially allows for deriving a quantum advantage. A data dependent projected quantum kernel was shown to provide significant advantage over classical kernels.
  arXiv  Detail & Related papers  (2024-05-02T23:45:29Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Numerical evidence against advantage with quantum fidelity kernels on classical data [12.621805903645711]
  We show that quantum kernels suffer from exponential "flattening" of the spectrum as the number of qubits grows. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data.
  arXiv  Detail & Related papers  (2022-11-29T19:23:11Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)

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.