Customer segmentation is strategic for increasing business revenues, as it allows a company to offer tailored products and services. Companies have access to vast amounts of information to generate customer clusters. In the banking sector, for instance, transactional data may reveal several hidden customer characteristics. The lookalike clustering problem aims to expand an initial cluster by detecting similar customers from a larger set. In this work, we model the lookalike clustering problem as a Quadratic Unconstrained Binary Optimization problem and solve it by means of a Quantum Annealer (QA). We tune the penalization parameters of the QA through an adaptive subgradient-inspired algorithm. We then compare QA performance against those obtained by a Simulated Annealing and the classical integer programming solver Gurobi. The results show that QA, when properly tuned, is able to find the optimal solution for small instances of the problem, even when the number of variables exceeds the number of couplers of QA. It fails, instead, for larger ones, due to the high level of noise. The results also show that QA requires a very short time to generate feasible and optimal solutions compared to classical algorithms, thus proving its potential for the solution of fully connected graphs.
Customer segmentation is strategic for increasing business revenues, as it allows a company to offer tailored products and services. Companies have access to vast amounts of information to generate customer clusters. In the banking sector, for instance, transactional data may reveal several hidden customer characteristics. The lookalike clustering problem aims to expand an initial cluster by detecting similar customers from a larger set. In this work, we model the lookalike clustering problem as a Quadratic Unconstrained Binary Optimization problem and solve it by means of a Quantum Annealer (QA). We tune the penalization parameters of the QA through an adaptive subgradient-inspired algorithm. We then compare QA performance against those obtained by a Simulated Annealing and the classical integer programming solver Gurobi. The results show that QA, when properly tuned, is able to find the optimal solution for small instances of the problem, even when the number of variables exceeds the number of couplers of QA. It fails, instead, for larger ones, due to the high level of noise. The results also show that QA requires a very short time to generate feasible and optimal solutions compared to classical algorithms, thus proving its potential for the solution of fully connected graphs.
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 article investigates the potential of quantum clustering, specifi cally through quantum annealing, to enhance supply chain segmentation compared with classical K-Means. Using a proof-of-concept framework, clustering is translated into a Quadratic Unconstrained Binary Optimisation formulation, tested on customer datasets via both classical Simulated Annealing and D-Wave’s Leap hybrid solver, with penalty parameter optimisation introduced to address solver sensitivity. Performance is benchmarked against K-Means on runtime, accuracy metrics, and scalability, across dataset sizes from 200 to 5,000 points. Results show that while K-Means maintains superior inertia and stability, the hybrid quantum approach achieves faster solver-reported runtimes and, on a simplifi ed 200-point, two-feature benchmark, delivers improved silhouette, Davies-Bouldin, Calinski-Harabasz, and Dunn scores once penalties are optimised — metrics which, it is noted, reward the balanced partitions structurally favoured by the pairwise QUBO objective. However, scalability remains constrained by current qubit capacity and solver access, limiting practical deployment beyond mid-sized datasets. The study concludes that classical methods remain dominant for industrial-scale segmentation; the demonstrated framework, penalty-optimisation pipeline, and objective-level analysis nonetheless provide a documented foundation, grounded in a customer segmentation case study, upon which future quantum-assisted supply chain clustering can build as hardware matures.
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimization. The algorithm can be seen as an analog of quantum annealing under the restriction of a product-state space, where the dynamical evolution in quantum annealing is replaced with a gradient-descent-based method. This formulation is able to quickly find high-quality solutions to large-scale problem instances and can naturally be accelerated by dedicated hardware such as graphics processing units. We benchmark our approach for large-scale problem instances with tunable hardness and planted solutions. We find that our algorithm offers a similar performance to current state-of-the-art approaches within a comparably simple gradient-based and nonstochastic setting.
Graph partitioning is a fundamental problem in various fields, including computer graphics, high-performance computing, and network design. Traditional graph partitioning algorithms often suffer from high computational complexity, particularly when dealing with large and complex graphs. This research investigates the potential of quantum-inspired optimization techniques, specifically leveraging concepts from quantum annealing, to accelerate the graph partitioning process. We formulate the graph partitioning problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, allowing us to simulate the behavior of a quantum annealer on classical hardware. The core of our approach involves mapping the graph's connectivity structure onto a QUBO, representing nodes as binary variables and edges as constraints. By exploiting the inherent parallelism of quantum annealing, we aim to find optimal or near-optimal partitions significantly faster than conventional methods. The results demonstrate the feasibility and potential advantages of this quantum-inspired strategy for graph partitioning, offering a promising direction for tackling computationally intensive graph problems.
Recent advances in quantum computing have shown great potential for solving combinatorial optimization problems. A notable example is the quadratic knapsack problem, a constrained binary optimization problem. However, current quantum-inspired algorithms require Quadratic Unconstrained Binary Optimization (QUBO) formulations. Transforming constrained optimization into QUBO impacts the algorithms' speed and efficiency. In this study, we evaluate five existing transformation methods and propose four novel approaches. We assess them by using Simulated Annealing (SA), and find that three of our approaches outperform existing methods in terms of execution time as well as quality and quantity of feasible solutions found. Also, we tested these transformations on a quantum annealer, which was unable to solve even small instances, due to limitations in connectivity and error rates. In general, our results highlight the advantages of the new approaches, which reduce the number of variables in the QUBO representation.
This article empirically examines the computational cost of solving a known hard problem, graph clustering, using novel purpose-built computer hardware. We express the graph clustering problem as an intra-cluster distance or dissimilarity minimization problem. We formulate our poblem as a quadratic unconstrained binary optimization problem and employ a novel computer architecture to obtain a numerical solution. Our starting point is a clustering formulation from the literature. This formulation is then converted to a quadratic unconstrained binary optimization formulation. Finally, we use a novel purpose-built computer architecture to obtain numerical solutions. For benchmarking purposes, we also compare computational performances to those obtained using a commercial solver, Gurobi, running on conventional hardware. Our initial results indicate the purpose-built hardware provides equivalent solutions to the commercial solver, but in a very small fraction of the time required.