A Predictive Approach for Selecting the Best Quantum Solver for an Optimization Problem
arXiv:2408.03613 · doi:10.1109/QCE60285.2024.00121
Abstract
Leveraging quantum computers for optimization problems holds promise across various application domains. Nevertheless, utilizing respective quantum computing solvers requires describing the optimization problem according to the Quadratic Unconstrained Binary Optimization (QUBO) formalism and selecting a proper solver for the application of interest with a reasonable setting. Both demand significant proficiency in quantum computing, QUBO formulation, and quantum solvers, a background that usually cannot be assumed by end users who are domain experts rather than quantum computing specialists. While tools aid in QUBO formulations, support for selecting the best-solving approach remains absent. This becomes even more challenging because selecting the best solver for a problem heavily depends on the problem itself. In this work, we are accepting this challenge and propose a predictive selection approach, which aids end users in this task. To this end, the solver selection task is first formulated as a classification task that is suitable to be solved by supervised machine learning. Based on that, we then propose strategies for adjusting solver parameters based on problem size and characteristics. Experimental evaluations, considering more than 500 different QUBO problems, confirm the benefits of the proposed solution. In fact, we show that in more than 70% of the cases, the best solver is selected, and in about 90% of the problems, a solver in the top two, i.e., the best or its closest suboptimum, is selected. This exploration proves the potential of machine learning in quantum solver selection and lays the foundations for its automation, broadening access to quantum optimization for a wider range of users.
IEEE International Conference on Quantum Computing and Engineering (QCE) 2024
References in corpus (21)
- Scikit-learn: Machine Learning in Python
- XGBoost: A Scalable Tree Boosting System
- A variational eigenvalue solver on a quantum processor
- Ising formulations of many NP problems
- The Variational Quantum Eigensolver: a review of methods and best practices
- Quantum Optimization of Fully-Connected Spin Glasses
- Open source software in quantum computing
- Quantum Annealing: An Overview
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Grover Adaptive Search for Constrained Polynomial Binary Optimization
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Intel Quantum Simulator: A cloud-ready high-performance simulator of quantum circuits
- Modernizing Quantum Annealing using Local Searches
- The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing
- Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction
- Scaling overhead of embedding optimization problems in quantum annealing
- MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum Computing
- Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
- Towards an Automated Framework for Realizing Quantum Computing Solutions
- Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies with Higher-Order Formulations
- Towards an Automatic Framework for Solving Optimization Problems with Quantum Computers