PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
Open accessThe DOI matches its Crossref record; the references it cites are not checked yet.
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This con fi guration aims to approximate real-world optimization problems, which usually require a dense QUBO matrix 4,34 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [34]
In the citing paper
“In contrast, real-world problems feature fully connected con fi gurations, corresponding to a density of 100%.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [34]
Citations
The citation lists are queued
They are fetched later and appear here then.
References 30 · Cited by 114
Metadata
- Authors
- Zaman, M., Tanahashi, K., & Tanaka, S.
- Affiliations
- Recruit Co., Ltd., Chuo-ku, Tokyo, Japan
- Waseda University (JP)
- Venue
- IEEE Transactions on Computers
- Published
- 2022-04-01
- Volume
- 71
- Issue
- 4
- Pages
- 838-850
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W3135445014
- Semantic Scholar
- 4f3750ee6320eea6bbda698eb185f932bdbf02dd
- Cited by
- 114
- References
- 30
- Citations by year
- 2026: 26 · 2025: 23 · 2024: 31 · 2023: 22 · 2022: 8
- FWCI
- 5.75
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Computers (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Funders
- JST
- Precursory Research for Embryonic Science and Technology (JPMJPR1665)
- JSPS KAKENHI (19H01553)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Keywords
- QUBO, combinatorial optimization, Ising model, quantum annealing, Ising machines, number partitioning problem, knapsack problem, graph coloring, integer factorization, binary multiplier, open-source Python package
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form. https://app.cochat.ai/papers/10.1109/tc.2021.3063618
- The paper
- Zaman, M., Tanahashi, K., & Tanaka, S. (2022). PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2021.3063618
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.