Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms.
Gian Giacomo GuerreschiPublished in: CoRR (2021)
Keyphrases
- computational complexity
- combinatorial optimization
- optimization problems
- discrete optimization
- computationally efficient
- theoretical analysis
- objective function
- non binary
- optimization methods
- orders of magnitude
- pairwise
- computational cost
- convex optimization problems
- np complete
- global optimization
- convex optimization
- global convergence
- feature selection
- quadratic program