Overview
This post summarizes arXiv paper 2509.05827 by Niloy Kumar Mondal and Md Rizwan Parvez, on automatically generating Quadratic Unconstrained Binary Optimization (QUBO) formulations from natural language.
Background
QUBO is a central formulation for combinatorial optimization and has gained increasing attention due to its compatibility with quantum, hybrid quantum-classical, and quantum-inspired solvers. However, translating natural-language problem descriptions into correct QUBO formulations remains difficult, requiring the identification of:
- Binary variables
- Constraints
- Objective functions
- Penalty terms
- Suitable penalty weights
- The framework achieves 68% accuracy on QUBOBench.
- This is 22 percentage points higher than a direct single-call baseline.
- Analysis shows that iterative self-repair is the most important component for improving performance.
This process is time-consuming and often demands substantial domain expertise.
Approach
The authors propose an end-to-end multi-agent framework that automatically generates QUBO formulations from natural-language problem descriptions, supported by both structured and unstructured test cases.
Evaluation: QUBOBench
To evaluate performance, the paper introduces QUBOBench, a benchmark of 100 combinatorial optimization problems across 12 application domains, curated from peer-reviewed literature, competitions, and classic NP-hard problems.
Results
Resources
Data and code are open-sourced. Full paper: arXiv:2509.05827