Preprint
Sep 2026
Binary Optimization with Complex Constraints via Quantum Approximate Multi-Objective Optimization
It is shown that a class of binary optimization problems with complex non-quadratic objectives or constraints can be reformulated as multi-objective quadratic unconstrained binary optimization problems and evaluated classically on Pareto-optimal candidates rather than encoded as penalties.
Andres D. Ruiz, Soumyadip Ghosh, S. Woerner
· 0 citations