PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
arXiv:2103.01708
Abstract
We present PyQUBO, an open-source, Python library for constructing quadratic unconstrained binary optimizations (QUBOs) from the objective functions and the constraints of optimization problems. PyQUBO enables users to prepare QUBOs or Ising models for various combinatorial optimization problems with ease thanks to the abstraction of expressions and the extensibility of the program. QUBOs and Ising models formulated using PyQUBO are solvable by Ising machines, including quantum annealing machines. We introduce the features of PyQUBO with applications in the number partitioning problem, knapsack problem, graph coloring problem, and integer factorization using a binary multiplier. Moreover, we demonstrate how PyQUBO can be applied to production-scale problems through integration with quantum annealing machines. Through its flexibility and ease of use, PyQUBO has the potential to make quantum annealing a more practical tool among researchers.
arXiv comment13 pages, 7 figures
References in corpus (9)
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum annealing with more than one hundred qubits
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- A practical heuristic for finding graph minors
- Expanding the horizon of automated metamaterials discovery via quantum annealing
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer