Towards an Automatic Framework for Solving Optimization Problems with Quantum Computers
arXiv:2406.12840 · doi:10.1109/QSW62656.2024.00019
Abstract
Optimizing objective functions stands to benefit significantly from leveraging quantum computers, promising enhanced solution quality across various application domains in the future. However, harnessing the potential of quantum solvers necessitates formulating problems according to the Quadratic Unconstrained Binary Optimization (QUBO) model, demanding significant expertise in quantum computation and QUBO formulations. This expertise barrier limits access to quantum solutions. Fortunately, automating the conversion of conventional optimization problems into QUBO formulations presents a solution for promoting accessibility to quantum solvers. This article addresses the unmet need for a comprehensive automatic framework to assist users in utilizing quantum solvers for optimization tasks while preserving interfaces that closely resemble conventional optimization practices. The framework prompts users to specify variables, optimization criteria, as well as validity constraints and, afterwards, allows them to choose the desired solver. Subsequently, it automatically transforms the problem description into a format compatible with the chosen solver and provides the resulting solution. Additionally, the framework offers instruments for analyzing solution validity and quality. Comparative analysis against existing libraries and tools in the literature highlights the comprehensive nature of the proposed framework. Two use cases (the knapsack problem and linear regression) are considered to show the completeness and efficiency of the framework in real-world applications. Finally, the proposed framework represents a significant advancement towards automating quantum computing solutions and widening access to quantum optimization for a broader range of users.
12 pages, 3 figures, article to be presented in IEEE International Conference on Quantum Software (QSW) 2024
References in corpus (17)
- A variational eigenvalue solver on a quantum processor
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- Quantum Optimization of Fully-Connected Spin Glasses
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Open source software in quantum computing
- Quantum Annealing: An Overview
- Probing for quantum speedup in spin glass problems with planted solutions
- 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
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
- 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
- Practical Integer-to-Binary Mapping for Quantum Annealers
- Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem