Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering

• URL: http://arxiv.org/abs/2507.15063v1
• Date: Sun, 20 Jul 2025 17:59:14 GMT
• Title: Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering
• Authors: Chloe Pomeroy, Aleksandar Pramov, Karishma Thakrar, Lakshmi Yendapalli,
• Abstract summary: We implement both quantum and classical solvers to compare their effectiveness.<n>For feature selection, we propose several QUBO configurations that balance feature importance and redundancy.<n>In instance selection, we propose a few novels for instance-level importance measures that extend existing methods.<n>For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement.
• Score: 41.94295877935867
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.

Related papers

• Quantum Phases Classification Using Quantum Machine Learning with SHAP-Driven Feature Selection [0.0]
  We present an innovative methodology to classify quantum phases within the ANNNI (Axial Next-Nearest Neighbor Ising) model.<n>Our investigation focuses on two prominent QML algorithms: Quantum Support Vector (QSVM) and Variational Quantums (VQC)<n>The results reveal that both QSVM and VQC exhibit exceptional predictive accuracy when limited to 5 or 6 key features.
  arXiv  Detail & Related papers  (2025-04-14T19:51:26Z)
• Hierarchical Quantum Optimization via Backbone-Driven Problem Decomposition: Integrating Tabu-Search with QAOA [6.1238490000465635]
  We propose Backbone-DrivenOA to overcome limitations of Noisy Intermediate Scale Quantum (NISQ) devices.<n>In our approach, adaptive Tabu search dynamically identifies and fixes backbone variables to construct reduced-dimensional subspaces.<n>Our proposed framework effectively orchestrates the allocation of quantum and classical resources, thereby enabling the solution of large-scale optimization problems.
  arXiv  Detail & Related papers  (2025-04-13T13:50:38Z)
• 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)
• A clustering aggregation algorithm on neutral-atoms and annealing quantum processors [0.44531072184246007]
  This work presents a hybrid quantum-classical algorithm to perform clustering aggregation.<n>It is designed for neutral-atoms quantum computers and quantum annealers.<n>Findings suggest promising potential for future advancements in hybrid quantum-classical pipelines.
  arXiv  Detail & Related papers  (2024-12-10T14:48:44Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Variational Quantum Linear Solver enhanced Quantum Support Vector Machine [3.206157921187139]
  We propose a novel approach called the Variational Quantum Linear solver (VQLS) enhanced QSVM. This is built upon our idea of utilizing the variational quantum linear solver to solve system of linear equations of a least squares-SVM on a NISQ device. The implementation of our approach is evaluated by an extensive series of numerical experiments with the Iris dataset.
  arXiv  Detail & Related papers  (2023-09-14T14:59:58Z)
• Variational Quantum Approximated Spectral Clustering [0.6718184400443239]
  We propose Variational Quantum Approximated Spectral Clustering (VQASC), which extends quantum distance-based classifier models to the clustering framework.<n>Our approach uses efficient quantum circuit designs whose depth scales sub-quadratically with dataset size, enabling the computation of weighted sums over various matrix representations of an undirected graph.
  arXiv  Detail & Related papers  (2023-09-08T17:54:42Z)
• A Review on Quantum Approximate Optimization Algorithm and its Variants [47.89542334125886]
  The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve intractable optimization problems. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios. We conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm.
  arXiv  Detail & Related papers  (2023-06-15T15:28:12Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Quantum Machine Learning with SQUID [64.53556573827525]
  We present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. We provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset.
  arXiv  Detail & Related papers  (2021-04-30T21:34:11Z)
• Tabu-driven Quantum Neighborhood Samplers [2.9934511331003555]
  Combinatorial optimization is an important application numerically targeted by quantum computing. One option to achieve advantages with near-term devices is to use them in combination with classicals. We show that QAOA provides a flexible tool for exploration Algorithm-exploitation in such hybrid settings.
  arXiv  Detail & Related papers  (2020-11-18T19:30: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.