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

arXiv:2506.14129 · Entropy

A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems

Yuxuan Zhang, Shuchang Wang, Wei Yang

Published Aug 6, 2026• 1 citation
arXivHTMLPDF

Abstract

Search-based software engineering (SBSE) tackles critical optimization problems in software engineering, including the next release problem (NRP) and feature selection problem (FSP). Traditional heuristic approaches and integer linear programming (ILP) methods work well for small- to medium-scale problems but face growing computational cost as instances scale up. We investigate quantum annealing (QA) as an optimization subroutine for multi-objective SBSE problems. We propose two QA-based algorithms tailored to different problem scales. For small-scale problems, we reformulate multi-objective optimization (MOO) as single-objective optimization (SOO) using penalty-based mappings for quantum processing. For large-scale problems that exceed current hardware capacity, we employ a decomposition strategy guided by maximum energy impact (MEI) that partitions the problem into smaller sub-QUBOs, integrating QA with a steepest-descent method for local search. Applied to NRP and FSP, our approaches are benchmarked against the heuristic NSGA-II, IBEA, and MOEA/D, as well as the ILP-based ϵ-constraint method. The experimental results reveal that while our methods produce fewer non-dominated solutions than ϵ-constraint, they achieve substantial reductions in execution time. Compared to the evolutionary baselines, our methods achieve competitive solution quality with lower runtime on the instances that they can encode. The penalty-based QUBO formulation fails to reach feasible regions on constraint-dense FSP instances, limiting the current applicability of the approach. QA is a promising but still hardware-limited component for multi-objective SBSE workflows, rather than a wholesale replacement for classical solvers.

DOI
10.3390/e28080886

Related papers

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 annealing feature selection on light-weight medical image datasets: A comprehensive study

Islam, Md, Mohaiminul, Md Fahim, Orbe, Nabil, Kowsar +4 more

We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image datasets.Feature selection is often formulated as a k of n selection problem, where the complexity grows binomially with increasing k and n.Quantum computers, particularly quantum annealers, are well-suited for such problems, which may offer advantages under certain problem formulations.We present a method to solve larger feature selection instances than previously demonstrated on commercial quantum annealers.Our approach combines a linear Ising penalty mechanism with subsampling and thresholding techniques to enhance scalability.The method is tested in a toy problem where feature selection identifies pixel masks used to reconstruct small-scale medical images.We compare our approach against a range of feature selection strategies, including randomized baselines, classical supervised and unsupervised methods, combinatorial optimization via classical and quantum solvers, and learning-based feature representations.The results indicate that quantum annealing-based feature selection is effective for this simplified use case, demonstrating its potential in high-dimensional optimization tasks.However, its applicability to broader, real-world problems remains uncertain, given the current limitations of quantum computing hardware.While learned feature representations such as autoencoders achieve superior reconstruction performance, they do not offer the same level of interpretability or direct control over input feature selection as our approach.

•Feb 6, 2026•0 citations

Towards scalable quantum annealing for pooling and blending problems: A methodological proof-of-concept

Vasileios K. Mappas, Bogdan Dorneanu, Eduardo Nolasco +2 more

Industrial optimization challenges, such as the pooling and blending problem (PBP), require advanced computational methods to address non-convexity and scalability limitations in classical solvers. This work introduces a novel methodological framework for solving PBPs using quantum annealing (QA) that transforms the PBP into quadratic unconstrained binary optimization (QUBO) formulations at two resolution levels, enabling direct deployment on quantum annealers. Key innovations include a discretization technique tailored for PBP’s bilinear constraints and an embedding method optimized for current quantum hardware. Benchmarking against classical solvers focuses on Haverly’s classical three-stream PBP, enabling transparent comparison and development of quantum embedding and solution techniques. The proposed framework offers a scalable template for adapting similar engineering systems to quantum annealing architectures. Addressing genuine industrial-scale instances will require future advances in quantum hardware and embedding algorithms. The results demonstrate that QA exhibits the best performance among the examined alternatives, provide foundational insights towards leveraging QA in Process Systems Engineering.

Process Safety and Environmental Protection•Aug 24, 2025•2 citations

Transverse-Field Quantum Annealing with Sparsified Ising-Penalized QUBO for Max-Relevance Min-Redundancy Feature Selection on NISQ-Era Biomedical Image Datasets

Islam, Md, Mohaiminul, Md Fahim, Orbe, Nabil, Kowsar +4 more

We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image datasets. Feature selection is often formulated as a k of n selection problem, where the complexity grows binomially with increasing k and n. Quantum computers, particularly quantum annealers, are well-suited for such problems, which may offer advantages under certain problem formulations. We present a method to solve larger feature selection instances than previously demonstrated on commercial quantum annealers. Our approach combines a linear Ising penalty mechanism with subsampling and thresholding techniques to enhance scalability. The method is tested in a toy problem where feature selection identifies pixel masks used to reconstruct small-scale medical images. We compare our approach against a range of feature selection strategies, including randomized baselines, classical supervised and unsupervised methods, combinatorial optimization via classical and quantum solvers, and learning-based feature representations. The results indicate that quantum annealing-based feature selection is effective for this simplified use case, demonstrating its potential in high-dimensional optimization tasks. However, its applicability to broader, real-world problems remains uncertain, given the current limitations of quantum computing hardware. While learned feature representations such as autoencoders achieve superior reconstruction performance, they do not offer the same level of interpretability or direct control over input feature selection as our approach.

•Feb 6, 2026•0 citations

A Study on Dynamic Optimization Methods of Annealing Coefficients in Quantum Computing

Guixiang JIN, Zhe Jin, Hiroaki MATSUKAWA

Quantum computing has emerged as a promising computational paradigm with the potential to solve problems that are intractable for classical computers. This paper provides an overview of the current state of quantum computing, including its historical development, hardware advancements, applications, and challenges. Special attention is given to combinatorial optimization, which is considered one of the most promising application domains. The limitations of current quantum systems and future research directions are also discussed. This paper presents a comparative study between a conventional D-Wave-based simulated annealing approach and a proposed hybrid optimization model for solving largescale combinatorial optimization problems. The study focuses on benchmark problems, including AES, TSP gr24, and a real-world load balancing problem, all formulated as QUBO models. The D-Wave approach employs the dwave-neal simulated annealing engine with various parameter settings, while the proposed model introduces a decomposition-based framework combined with adaptive parameter control and iterative refinement. The experimental results demonstrate that the proposed model consistently outperforms the conventional approach in terms of solution quality, achieving significantly lower energy values across all problem instances. In particular, for the TSP gr24 problem, the proposed model achieves near-optimal solutions with substantially reduced computation time. For large-scale problems such as AES and load balancing, the proposed model maintains scalability and robustness, whereas the conventional approach suffers from increased computational cost and performance degradation. Although the proposed method introduces additional computational steps, its hybrid structure effectively mitigates limitations related to local minima, parameter sensitivity, and scalability. These findings indicate that integrating classical optimization techniques with quantum-inspired methods is essential for practical applications. The proposed model provides a promising framework for solving complex real-world optimization problems and highlights the importance of hybrid approaches in advancing quantum annealing technologies.

Innovation and supply chain management•Mar 31, 2026•0 citations

Quantum annealing feature selection on light-weight medical image datasets

Merlin A. Nau, Luca A. Nutricati, Bruno Camino +2 more

We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image datasets. Feature selection is often formulated as a k of n selection problem, where the complexity grows binomially with increasing k and n. Quantum computers, particularly quantum annealers, are well-suited for such problems, which may offer advantages under certain problem formulations. We present a method to solve larger feature selection instances than previously demonstrated on commercial quantum annealers. Our approach combines a linear Ising penalty mechanism with subsampling and thresholding techniques to enhance scalability. The method is tested in a toy problem where feature selection identifies pixel masks used to reconstruct small-scale medical images. We compare our approach against a range of feature selection strategies, including randomized baselines, classical supervised and unsupervised methods, combinatorial optimization via classical and quantum solvers, and learning-based feature representations. The results indicate that quantum annealing-based feature selection is effective for this simplified use case, demonstrating its potential in high-dimensional optimization tasks. However, its applicability to broader, real-world problems remains uncertain, given the current limitations of quantum computing hardware. While learned feature representations such as autoencoders achieve superior reconstruction performance, they do not offer the same level of interpretability or direct control over input feature selection as our approach.

arXiv:2502.19201•Scientific Reports•Aug 7, 2025•13 citations
Search-based software engineering (SBSE) tackles critical optimization problems in software engineering, including the next release problem (NRP) and feature selection problem (FSP). Traditional heuristic approaches and integer linear programming (ILP) methods work well for small- to medium-scale problems but face growing computational cost as instances scale up. We investigate quantum annealing (QA) as an optimization subroutine for multi-objective SBSE problems. We propose two QA-based algorithms tailored to different problem scales. For small-scale problems, we reformulate multi-objective optimization (MOO) as single-objective optimization (SOO) using penalty-based mappings for quantum processing. For large-scale problems that exceed current hardware capacity, we employ a decomposition strategy guided by maximum energy impact (MEI) that partitions the problem into smaller sub-QUBOs, integrating QA with a steepest-descent method for local search. Applied to NRP and FSP, our approaches are benchmarked against the heuristic NSGA-II, IBEA, and MOEA/D, as well as the ILP-based ϵ-constraint method. The experimental results reveal that while our methods produce fewer non-dominated solutions than ϵ-constraint, they achieve substantial reductions in execution time. Compared to the evolutionary baselines, our methods achieve competitive solution quality with lower runtime on the instances that they can encode. The penalty-based QUBO formulation fails to reach feasible regions on constraint-dense FSP instances, limiting the current applicability of the approach. QA is a promising but still hardware-limited component for multi-objective SBSE workflows, rather than a wholesale replacement for classical solvers.
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.
We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image datasets.Feature selection is often formulated as a k of n selection problem, where the complexity grows binomially with increasing k and n.Quantum computers, particularly quantum annealers, are well-suited for such problems, which may offer advantages under certain problem formulations.We present a method to solve larger feature selection instances than previously demonstrated on commercial quantum annealers.Our approach combines a linear Ising penalty mechanism with subsampling and thresholding techniques to enhance scalability.The method is tested in a toy problem where feature selection identifies pixel masks used to reconstruct small-scale medical images.We compare our approach against a range of feature selection strategies, including randomized baselines, classical supervised and unsupervised methods, combinatorial optimization via classical and quantum solvers, and learning-based feature representations.The results indicate that quantum annealing-based feature selection is effective for this simplified use case, demonstrating its potential in high-dimensional optimization tasks.However, its applicability to broader, real-world problems remains uncertain, given the current limitations of quantum computing hardware.While learned feature representations such as autoencoders achieve superior reconstruction performance, they do not offer the same level of interpretability or direct control over input feature selection as our approach.
Industrial optimization challenges, such as the pooling and blending problem (PBP), require advanced computational methods to address non-convexity and scalability limitations in classical solvers. This work introduces a novel methodological framework for solving PBPs using quantum annealing (QA) that transforms the PBP into quadratic unconstrained binary optimization (QUBO) formulations at two resolution levels, enabling direct deployment on quantum annealers. Key innovations include a discretization technique tailored for PBP’s bilinear constraints and an embedding method optimized for current quantum hardware. Benchmarking against classical solvers focuses on Haverly’s classical three-stream PBP, enabling transparent comparison and development of quantum embedding and solution techniques. The proposed framework offers a scalable template for adapting similar engineering systems to quantum annealing architectures. Addressing genuine industrial-scale instances will require future advances in quantum hardware and embedding algorithms. The results demonstrate that QA exhibits the best performance among the examined alternatives, provide foundational insights towards leveraging QA in Process Systems Engineering.
We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image datasets. Feature selection is often formulated as a k of n selection problem, where the complexity grows binomially with increasing k and n. Quantum computers, particularly quantum annealers, are well-suited for such problems, which may offer advantages under certain problem formulations. We present a method to solve larger feature selection instances than previously demonstrated on commercial quantum annealers. Our approach combines a linear Ising penalty mechanism with subsampling and thresholding techniques to enhance scalability. The method is tested in a toy problem where feature selection identifies pixel masks used to reconstruct small-scale medical images. We compare our approach against a range of feature selection strategies, including randomized baselines, classical supervised and unsupervised methods, combinatorial optimization via classical and quantum solvers, and learning-based feature representations. The results indicate that quantum annealing-based feature selection is effective for this simplified use case, demonstrating its potential in high-dimensional optimization tasks. However, its applicability to broader, real-world problems remains uncertain, given the current limitations of quantum computing hardware. While learned feature representations such as autoencoders achieve superior reconstruction performance, they do not offer the same level of interpretability or direct control over input feature selection as our approach.
Quantum computing has emerged as a promising computational paradigm with the potential to solve problems that are intractable for classical computers. This paper provides an overview of the current state of quantum computing, including its historical development, hardware advancements, applications, and challenges. Special attention is given to combinatorial optimization, which is considered one of the most promising application domains. The limitations of current quantum systems and future research directions are also discussed. This paper presents a comparative study between a conventional D-Wave-based simulated annealing approach and a proposed hybrid optimization model for solving largescale combinatorial optimization problems. The study focuses on benchmark problems, including AES, TSP gr24, and a real-world load balancing problem, all formulated as QUBO models. The D-Wave approach employs the dwave-neal simulated annealing engine with various parameter settings, while the proposed model introduces a decomposition-based framework combined with adaptive parameter control and iterative refinement. The experimental results demonstrate that the proposed model consistently outperforms the conventional approach in terms of solution quality, achieving significantly lower energy values across all problem instances. In particular, for the TSP gr24 problem, the proposed model achieves near-optimal solutions with substantially reduced computation time. For large-scale problems such as AES and load balancing, the proposed model maintains scalability and robustness, whereas the conventional approach suffers from increased computational cost and performance degradation. Although the proposed method introduces additional computational steps, its hybrid structure effectively mitigates limitations related to local minima, parameter sensitivity, and scalability. These findings indicate that integrating classical optimization techniques with quantum-inspired methods is essential for practical applications. The proposed model provides a promising framework for solving complex real-world optimization problems and highlights the importance of hybrid approaches in advancing quantum annealing technologies.
We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image datasets. Feature selection is often formulated as a k of n selection problem, where the complexity grows binomially with increasing k and n. Quantum computers, particularly quantum annealers, are well-suited for such problems, which may offer advantages under certain problem formulations. We present a method to solve larger feature selection instances than previously demonstrated on commercial quantum annealers. Our approach combines a linear Ising penalty mechanism with subsampling and thresholding techniques to enhance scalability. The method is tested in a toy problem where feature selection identifies pixel masks used to reconstruct small-scale medical images. We compare our approach against a range of feature selection strategies, including randomized baselines, classical supervised and unsupervised methods, combinatorial optimization via classical and quantum solvers, and learning-based feature representations. The results indicate that quantum annealing-based feature selection is effective for this simplified use case, demonstrating its potential in high-dimensional optimization tasks. However, its applicability to broader, real-world problems remains uncertain, given the current limitations of quantum computing hardware. While learned feature representations such as autoencoders achieve superior reconstruction performance, they do not offer the same level of interpretability or direct control over input feature selection as our approach.