Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Binary Unconstrained Quadratic Optimization Problem

Gary A. Kochenberger, Fred Glover, Haibo Wang

Published Jan 1, 2013• 7 citations
Publisher
DOI
10.1007/978-1-4419-7997-1_15

Related papers

The Quadratic Unconstrained Binary Optimization Problem

Springer eBooks•Jan 1, 2022•65 citations

Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem

Gintaras Palubeckis

Annals of Operations Research•Aug 27, 2004•147 citations

QUBO: Quadratic Unconstrained Binary Optimization Problem

Gary A. Kochenberger, Fred Glover, Haibo Wang

Springer eBooks•Dec 17, 2024•1 citation

Computing Local Optima in Quadratic Unconstrained Binary Optimization Problems in Randomized Polynomial Time

Lunshan Gao

•Jan 1, 2024•0 citations

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems

Fred Glover, Mark A. Lewis, Gary A. Kochenberger

European Journal of Operational Research•Aug 31, 2017•40 citations

On the hardness of quadratic unconstrained binary optimization problems

Vrinda Mehta, Fengping Jin, Kristel F. L. Michielsen +1 more

We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions. We also perform experiments with the D-Wave Advantage 5.1 quantum annealer, solving many instances of up to 170-variable, quadratic unconstrained binary optimization problems. Our results demonstrate that the exponents characterizing the success probability of a D-Wave annealer to solve a quadratic unconstrained binary optimization correlate very well with the predictions based on the Hamming distance distributions computed for small problem instances.

Frontiers in Physics•Aug 31, 2022•7 citations
We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions. We also perform experiments with the D-Wave Advantage 5.1 quantum annealer, solving many instances of up to 170-variable, quadratic unconstrained binary optimization problems. Our results demonstrate that the exponents characterizing the success probability of a D-Wave annealer to solve a quadratic unconstrained binary optimization correlate very well with the predictions based on the Hamming distance distributions computed for small problem instances.