Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
Integrity signals
Registry
Cites
Statistics
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?
The most prominent problem formulations for CO on quantum computers are the Ising-model and the equivalent Quadratic Unconstrained Binary Optimization (QUBO) model.
“The most prominent problem formulations for CO on quantum computers are the Ising-model [189] and the equivalent Quadratic Unconstrained Binary Optimization (QUBO) model [53, 150, 173].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [53]
Inequality constraints can be mapped to equality constraints, where additional variables have to be introduced.
“Inequality constraints can be mapped to equality constraints, where additional variables have to be introduced [53, 135].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [53]
Equations (4) and (5) are equivalent up to a linear transformation s_i = 2x_i -1.
“Equations (4) and (5) are equivalent up to a linear transformation s i = 2 x i -1 [53].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [53]
Studies that consider problem formulation transformations range from conceptual prescriptions to automated approaches, whereas studies dealing with performance dependencies are empirical in nature.
“Whereas studies that consider problem formulation transformations range from conceptual prescriptions [53] to automated approaches [150], the ones dealing with performance dependencies are empirical in nature.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [53]
The citation lists haven’t been fetched yet
References 73 · Cited by 298
- Authors
- Glover, F., Kochenberger, G., & Du, Y.
- Affiliations
- University of Colorado Boulder (US)
- University of Colorado Denver (US)
- Corresponding author
- Glover, Fred
- ORCID
- Venue
- 4OR
- Published
- 2019-11-26
- Volume
- 17
- Issue
- 4
- Pages
- 335-371
- ISSN
- 1614-2411 (ISSN-L)
- 1619-4500
- OpenAlex
- W2990475267
- Cited by
- 298
- References
- 73
- Citations by year
- 2026: 57 · 2025: 47 · 2024: 55 · 2023: 43 · 2022: 50 · 2021: 34 · 2020: 11 · 2019: 1
- FWCI
- 11.08
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- 4OR (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- QUBO, combinatorial optimization, quantum computing applications
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
