Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Machine Intelligence

QReduce: A novel quantum annealing approach for graph-based instance selection of high-fidelity training labels in supervised classification and regression datasets

Archit Chadalawada, Shaleen Bhatnagar

Published Jul 23, 2026• 0 citations
Publisher

Abstract

Abstract Instance selection algorithms for supervised classification and regression tasks in machine learning aim to reduce the size of training datasets whilst maintaining the performance of models by selecting the most important, high-fidelity training labels from a large pool of instances in the original datasets. Traditional instance selection methods such as cluster-based techniques demonstrate enhanced generalization capabilities on fewer data points compared with random sampling approaches, but often suffer from high computational costs, sensitivity to hyperparameters and non-deterministic time complexities. This paper proposes QReduce which is a novel instance selection algorithm which models datasets as N-dimensional graphs with each data point corresponding to a vertex and edges constructed between points in a k-nearest neighbour manner. This graph is subjected to quantum annealing to solve the minimum vertex cover or maximum cut graph combinatorial optimization problems and yield a subgraph representing the reduced subset of instances selected for the reduced dataset. Solving such NP-hard problems are intractable for exact classical solvers on account of combinatorial explosion of the problem’s search space, and quantum annealing was shown to outperform other approximate metaheuristic techniques such as simulated annealing, justifying it as a strong metaheuristic optimization model. QReduce enables recursive reduction of the dataset and has the benefits of less sensitivity to hyperparameters as well as a deterministic time complexity, enabling efficient and effective reduction in storage and compute requirements for training complex machine learning models in the age of green and sustainable AI. Experimental results demonstrate the efficacy of QReduce, outperforming existing instance selection techniques and having the highest average percentage data reduction to percentage accuracy reduction ratios on datasets for both classification and regression tasks, thereby making it a best-in-class instance selection algorithm for selecting high-fidelity training labels in supervised machine learning tasks.

DOI
10.1007/s42484-026-00422-4

Related papers

A Quantum Annealing Instance Selection Approach for Efficient and Effective Transformer Fine-Tuning

Andrea Pasin, Washington Luiz Miranda da Cunha, Marcos André Gonçalves +1 more

Deep Learning approaches have become pervasive in recent years due to their ability to solve complex tasks. However, these models need huge datasets for proper training and good generalization. This translates into high training and fine-tuning time, even several days for the most complex models and large datasets. In this work, we present a novel quantum Instance Selection (IS) approach that allows to significantly reduce the size of the training datasets (by up to 28%) while maintaining the model's effectiveness, thus promoting (training) speedups and scalability. Our solution is innovative in the sense that it exploits a different computing paradigm - Quantum Annealing (QA) - a specific Quantum Computing paradigm that can be used to tackle optimization problems. To the best of our knowledge, there have been no prior attempts to tackle the IS problem using QA. Furthermore, we propose a new Quadratic Unconstrained Binary Optimization formulation specific for the IS problem, which is a contribution in itself. Through an extensive set of experiments with several Text Classification benchmarks, we empirically demonstrate our quantum solution's feasibility and competitiveness with the current state-of-the-art IS solutions.

ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR)•Aug 2, 2024•16 citations

Quantum annealing for semi-supervised learning

Yu-Lin Zheng, Wen Zhang, Cheng Zhou +1 more

Recent advances in quantum technology have led to the development and the manufacturing of programmable quantum annealers that promise to solve certain combinatorial optimization problems faster than their classical counterparts. Semi-supervised learning is a machine learning technique that makes use of both labeled and unlabeled data for training, which enables a good classifier with only a small amount of labeled data. In this paper, we propose and theoretically analyze a graph-based semi-supervised learning method with the aid of the quantum annealing technique, which efficiently utilizes the quantum resources while maintaining good accuracy. We illustrate two classification examples, suggesting the feasibility of this method even with a small portion (30%) of labeled data involved.

arXiv:2003.12459•Chinese Physics B•Feb 3, 2021•3 citations

Using Machine Learning for Quantum Annealing Accuracy Prediction

Aaron Barbosa, Elijah Pelofske, Georg Hahn +1 more

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters, such as the D-Wave’s chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.

arXiv:2106.00065•Algorithms•Jun 21, 2021•13 citations

Multi-Task Quantum Annealing for Rapid Multi-Class Classification

Jargalsaikhan Artag, Moe Shimada, Jun‐ichi Shirakashi

Quantum computing offers new paradigms in machine learning, notably through Quantum Annealing (QA), which offers promising approaches to optimization problems. This study introduces an application of Multi-tasking Quantum Annealing (MTQA) to enhance multi-class Support Vector Machines (SVMs). Traditional QA methods require multiple cycles to classify multi-class datasets, significantly increasing computational demands. In contrast, MTQA embeds multiple SVM classifiers in parallel on a quantum annealer, thereby reducing the number of required annealing cycles to a single cycle. Utilizing the D-Wave Advantage 6.4 system, we evaluated our method across three benchmark datasets: a synthetic dataset (Blob), subsets of handwritten digits, and the Iris dataset with different feature focuses. Our findings demonstrate that MTQA achieves accuracy equivalent to that of classical Sequential Minimal Optimization (SMO), Simulated Annealing (SA), and standard QA methods while significantly improving computational efficiency. Despite the current limitations in quantum technology and the empirical selection of model parameters, these results highlight the emergent potential of quantum computing in machine learning. Further advancements in quantum algorithm optimization and parameter tuning are anticipated to enhance the efficacy of QA and MTQA, solidifying their practical application roles.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

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

Pomeroy, Chloe, Aleksandar Pramov, Karishma Thakrar +1 more

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.

arXiv:2507.15063•Jul 20, 2025•3 citations

Quantum Machine Learning: Feature Selection and Dimensionality Reduction

Jincheng Zhang

This paper explores the application of quantum algorithms for feature selection and dimensionality reduction within the field of quantum machine learning. Traditional methods for these tasks often suffer from computational bottlenecks, particularly when dealing with high-dimensional datasets. We propose a framework that leverages the principles of quantum computing to accelerate these processes. Specifically, we investigate the transformation of feature selection and dimensionality reduction problems into quantum optimization problems. We then examine the utilization of quantum annealing and variational quantum sampling algorithms for solving these problems. The core claim is that by employing quantum algorithms, we can significantly improve the efficiency and accuracy of machine learning models. The theoretical framework presented outlines a novel approach to tackling these challenges, offering a potential pathway towards more powerful and scalable quantum machine learning systems. This work provides a foundational exploration into this emerging area, focusing on the algorithmic strategies and potential benefits. ---

•Aug 31, 2026•0 citations
Abstract Instance selection algorithms for supervised classification and regression tasks in machine learning aim to reduce the size of training datasets whilst maintaining the performance of models by selecting the most important, high-fidelity training labels from a large pool of instances in the original datasets. Traditional instance selection methods such as cluster-based techniques demonstrate enhanced generalization capabilities on fewer data points compared with random sampling approaches, but often suffer from high computational costs, sensitivity to hyperparameters and non-deterministic time complexities. This paper proposes QReduce which is a novel instance selection algorithm which models datasets as N-dimensional graphs with each data point corresponding to a vertex and edges constructed between points in a k-nearest neighbour manner. This graph is subjected to quantum annealing to solve the minimum vertex cover or maximum cut graph combinatorial optimization problems and yield a subgraph representing the reduced subset of instances selected for the reduced dataset. Solving such NP-hard problems are intractable for exact classical solvers on account of combinatorial explosion of the problem’s search space, and quantum annealing was shown to outperform other approximate metaheuristic techniques such as simulated annealing, justifying it as a strong metaheuristic optimization model. QReduce enables recursive reduction of the dataset and has the benefits of less sensitivity to hyperparameters as well as a deterministic time complexity, enabling efficient and effective reduction in storage and compute requirements for training complex machine learning models in the age of green and sustainable AI. Experimental results demonstrate the efficacy of QReduce, outperforming existing instance selection techniques and having the highest average percentage data reduction to percentage accuracy reduction ratios on datasets for both classification and regression tasks, thereby making it a best-in-class instance selection algorithm for selecting high-fidelity training labels in supervised machine learning tasks.
Deep Learning approaches have become pervasive in recent years due to their ability to solve complex tasks. However, these models need huge datasets for proper training and good generalization. This translates into high training and fine-tuning time, even several days for the most complex models and large datasets. In this work, we present a novel quantum Instance Selection (IS) approach that allows to significantly reduce the size of the training datasets (by up to 28%) while maintaining the model's effectiveness, thus promoting (training) speedups and scalability. Our solution is innovative in the sense that it exploits a different computing paradigm - Quantum Annealing (QA) - a specific Quantum Computing paradigm that can be used to tackle optimization problems. To the best of our knowledge, there have been no prior attempts to tackle the IS problem using QA. Furthermore, we propose a new Quadratic Unconstrained Binary Optimization formulation specific for the IS problem, which is a contribution in itself. Through an extensive set of experiments with several Text Classification benchmarks, we empirically demonstrate our quantum solution's feasibility and competitiveness with the current state-of-the-art IS solutions.
Recent advances in quantum technology have led to the development and the manufacturing of programmable quantum annealers that promise to solve certain combinatorial optimization problems faster than their classical counterparts. Semi-supervised learning is a machine learning technique that makes use of both labeled and unlabeled data for training, which enables a good classifier with only a small amount of labeled data. In this paper, we propose and theoretically analyze a graph-based semi-supervised learning method with the aid of the quantum annealing technique, which efficiently utilizes the quantum resources while maintaining good accuracy. We illustrate two classification examples, suggesting the feasibility of this method even with a small portion (30%) of labeled data involved.
Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters, such as the D-Wave’s chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.
Quantum computing offers new paradigms in machine learning, notably through Quantum Annealing (QA), which offers promising approaches to optimization problems. This study introduces an application of Multi-tasking Quantum Annealing (MTQA) to enhance multi-class Support Vector Machines (SVMs). Traditional QA methods require multiple cycles to classify multi-class datasets, significantly increasing computational demands. In contrast, MTQA embeds multiple SVM classifiers in parallel on a quantum annealer, thereby reducing the number of required annealing cycles to a single cycle. Utilizing the D-Wave Advantage 6.4 system, we evaluated our method across three benchmark datasets: a synthetic dataset (Blob), subsets of handwritten digits, and the Iris dataset with different feature focuses. Our findings demonstrate that MTQA achieves accuracy equivalent to that of classical Sequential Minimal Optimization (SMO), Simulated Annealing (SA), and standard QA methods while significantly improving computational efficiency. Despite the current limitations in quantum technology and the empirical selection of model parameters, these results highlight the emergent potential of quantum computing in machine learning. Further advancements in quantum algorithm optimization and parameter tuning are anticipated to enhance the efficacy of QA and MTQA, solidifying their practical application roles.
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.
This paper explores the application of quantum algorithms for feature selection and dimensionality reduction within the field of quantum machine learning. Traditional methods for these tasks often suffer from computational bottlenecks, particularly when dealing with high-dimensional datasets. We propose a framework that leverages the principles of quantum computing to accelerate these processes. Specifically, we investigate the transformation of feature selection and dimensionality reduction problems into quantum optimization problems. We then examine the utilization of quantum annealing and variational quantum sampling algorithms for solving these problems. The core claim is that by employing quantum algorithms, we can significantly improve the efficiency and accuracy of machine learning models. The theoretical framework presented outlines a novel approach to tackling these challenges, offering a potential pathway towards more powerful and scalable quantum machine learning systems. This work provides a foundational exploration into this emerging area, focusing on the algorithmic strategies and potential benefits. ---