Quadratic Unconstrained Binary Optimization
Also known as QUBO
Overview
Quadratic unconstrained binary optimization represents decisions with binary variables and scores each assignment using a quadratic objective; constraints are often incorporated as penalty terms. Researchers solve these models with methods such as simulated annealing, quantum annealing, QAOA, quantum-inspired simulated bifurcation, and classical optimization, often alongside preprocessing, graph coarsening, or decomposition to reduce problem size. Applications range from routing, scheduling, and portfolio selection to image reconstruction, machine learning, and scientific sampling. A central challenge is making formulations fit limited hardware connectivity and precision while keeping penalties, noise, and approximation from undermining feasibility or real-world task performance.
Latest papers
21 papers1 paper in the last four weeks, down 67% on the four weeks before. 0.0% of all new papers.