Quadratic unconstrained binary optimization
Combinatorial optimization problem
Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide range of applications from finance and economics to machine learning. QUBO is an NP hard problem, and for many classical problems from theoretical computer science, like maximum cut, graph coloring and the partition problem, embeddings into QUBO have been formulated.
Nº Q7268372 ★
Common · History
Quadratic unconstrained binary optimization
Combinatorial optimization problem
Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide range of applications from finance and economics to machine learning. QUBO is an NP hard problem, and for many classical problems from theoretical computer science, like maximum cut, graph coloring and the partition problem, embeddings into QUBO have been formulated.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide range of applications from finance and economics to machine learning. QUBO is an NP hard problem, and for many classical problems from theoretical computer science, like maximum cut, graph coloring and the partition problem, embeddings into QUBO have been formulated. Embeddings for machine learning models include support-vector machines, clustering and probabilistic graphical models. Moreover, due to its close connection to Ising models, QUBO constitutes a central problem class for adiabatic quantum computation, where it is solved through a physical process called quantum annealing.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Integer programming
Mathematical optimization problem in which variables are restricted to be integers
Nº Q6042592 ★★
Not listed
-
U
Unique games conjecture
Conjecture in computational complexity
Nº Q7886950 ★
Not listed
-
Grover's algorithm
Quantum unstructured search algorithm that finds with high probability the unique input to a black box function that produces a particular output value using 𝑂(𝑁) evaluations
Nº Q1028292 ★★
Not listed
-
S
Sequential quadratic programming
Optimization algorithm
Nº Q4373881 ★
Not listed
-
P
Partition problem
NP-complete problem in computer science
Nº Q1065968 ★
Not listed
-
BQP
Complexity class
Nº Q601325 ★
Not listed